The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for the OEIS

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

A132393

Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.
(history; published version)

#286 by Michael De Vlieger at Mon Aug 31 20:53:53 EDT 2026

STATUS

reviewed

approved

A008517

Second-order Eulerian triangle T(n,k), 1 <= k <= n.
(history; published version)

#294 by Michael De Vlieger at Mon Aug 31 20:53:39 EDT 2026

STATUS

reviewed

approved

A172034

Partial sums of Pillai primes (A063980).
(history; published version)

#7 by Andrew Howroyd at Mon Aug 31 20:53:10 EDT 2026

STATUS

editing

proposed

A015278

Gaussian binomial coefficient [ n,3 ] for q = -10.
(history; published version)

#40 by Michael De Vlieger at Mon Aug 31 20:53:10 EDT 2026

STATUS

reviewed

approved

A035342

The convolution matrix of the double factorial of odd numbers (A001147).
(history; published version)

#162 by Michael De Vlieger at Mon Aug 31 20:53:04 EDT 2026

STATUS

reviewed

approved

A143495

Triangle read by rows: 3-Stirling numbers of the second kind.
(history; published version)

#74 by Michael De Vlieger at Mon Aug 31 20:52:59 EDT 2026

STATUS

reviewed

approved

A172034

Partial sums of Pillai primes (A063980).
(history; published version)

#6 by Andrew Howroyd at Mon Aug 31 20:51:59 EDT 2026

COMMENTS

The values alternate between odd and even. The first prime partial sum of Pillai primes is a(5) = 23 + 29 + 59 + 61 + 67 = 239. The second prime partial sum is a(7) = 389. The next such primes are a(11) = 857 (= the 72nd Pillai prime), a(23) = 3823, a(25) = 4451, a(27) = 5189. The coincidence which prompted this sequence is that the 266th Pillai prime is a(23), the sum of the first 23 Pillai primes. Curiously, 23 is the smallest Pillai prime. What are the next such Pillai primes in the partial sum?

The values alternate between odd and even.

FORMULA

a(n) = SUM[i=1..n] A063980(i) = SUM[i=1..n] {p: p prime and there exists an integer m such that m!+1 is 0 mod p and p is not 1 mod m}.

a(n) = Sum_{i=1..n} A063980(i).

CROSSREFS

Cf. A063980.

STATUS

proposed

editing

Discussion

Mon Aug 31

20:53

Andrew Howroyd: Yes, the notation is suboptimal. I have revised.

A143495

Triangle read by rows: 3-Stirling numbers of the second kind.
(history; published version)

#73 by Andrew Howroyd at Mon Aug 31 20:49:32 EDT 2026

STATUS

proposed

reviewed

A035342

The convolution matrix of the double factorial of odd numbers (A001147).
(history; published version)

#161 by Andrew Howroyd at Mon Aug 31 20:49:16 EDT 2026

STATUS

proposed

reviewed

A172034

Partial sums of Pillai primes (A063980).
(history; published version)

#5 by Qiyuan Gu at Mon Aug 31 20:49:05 EDT 2026

STATUS

editing

proposed

Showing entries 1-10 | older changes