The On-Line Encyclopedia of Integer Sequences (OEIS)

Revisions by OEIS Server

(See also OEIS Server's wiki page)

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A326875

BII-numbers of set-systems that are closed under union.
(history; published version)

#10 by OEIS Server at Thu Mar 06 21:02:12 EST 2025

LINKS

John Tyler Rascoe, <a href="/A326875/b326875_1.txt">Table of n, a(n) for n = 1..3000</a>

A369950

Triangle read by rows: T(n,k) = number of j-covers of [n] with j<=k, k=1..2^n-1.
(history; published version)

#34 by OEIS Server at Thu Mar 06 21:01:26 EST 2025

LINKS

John Tyler Rascoe, <a href="/A369950/b369950_1.txt">Rows n = 1..9, flattened</a>

A201545

Numbers n such that the n-th digit (after the decimal point) in the decimal expansion of Pi are the occurrence of the least significant digit represented by the more significant digits
(history; published version)

#18 by OEIS Server at Thu Mar 06 20:08:23 EST 2025

LINKS

Michael S. Branicky, <a href="/A201545/b201545_1.txt">Table of n, a(n) for n = 1..10000</a>

A379883

a(1) = 1. Let j = a(n-1) and r = A046144(j). Then for n > 1, if j is novel and r > 0, a(n) = r. If j is novel and r = 0 then a(n) = 1. If j has occurred k (>1) times already then a(n) = k*j.
(history; published version)

#28 by OEIS Server at Thu Mar 06 11:09:33 EST 2025

LINKS

Michael De Vlieger, <a href="/A379883/b379883_1.txt">Table of n, a(n) for n = 1..10000</a>

A302096

a(n) is the smallest pandigital number divisible by n, or 0 if no such pandigital number exists.
(history; published version)

#53 by OEIS Server at Thu Mar 06 11:01:44 EST 2025

LINKS

Michael S. Branicky, <a href="/A302096/b302096_1.txt">Table of n, a(n) for n = 1..10000</a>

A380293

Triangle read by rows: T(n, k) (2 <= k <= n) is the smallest positive integer m >= k such that the digits of m expressed in base n are the same as the first digits in base k.
(history; published version)

#45 by OEIS Server at Thu Mar 06 10:52:35 EST 2025

LINKS

Yifan Xie, <a href="/A380293/b380293_1.txt">Rows 2..73 of triangle, flattened</a>

A039959

Number of ways of numbering the vertices of a cube so sum of the 8 numbers is n.
(history; published version)

#17 by OEIS Server at Thu Mar 06 10:05:12 EST 2025

LINKS

Ray Chandler, <a href="/A039959/b039959_1.txt">Table of n, a(n) for n = 0..100</a>

A174321

Index of the smallest prime greater than (6n+1)^2.
(history; published version)

#19 by OEIS Server at Thu Mar 06 08:29:07 EST 2025

LINKS

Paolo Xausa, <a href="/A174321/b174321_1.txt">Table of n, a(n) for n = 0..10000</a> (terms 0..1000 from Robert Israel)

A381744

Expansion of exp( Sum_{k>=1} binomial(6*k-1,2*k) * x^k/k ).
(history; published version)

#16 by OEIS Server at Thu Mar 06 04:46:09 EST 2025

LINKS

Seiichi Manyama, <a href="/A381744/b381744_1.txt">Table of n, a(n) for n = 0..605</a>

A381745

Expansion of exp( Sum_{k>=1} binomial(8*k-1,2*k) * x^k/k ).
(history; published version)

#17 by OEIS Server at Thu Mar 06 04:46:06 EST 2025

LINKS

Seiichi Manyama, <a href="/A381745/b381745_1.txt">Table of n, a(n) for n = 0..514</a>