cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A183010 a(n) = 24*n - 1.

Original entry on oeis.org

-1, 23, 47, 71, 95, 119, 143, 167, 191, 215, 239, 263, 287, 311, 335, 359, 383, 407, 431, 455, 479, 503, 527, 551, 575, 599, 623, 647, 671, 695, 719, 743, 767, 791, 815, 839, 863, 887, 911, 935, 959, 983, 1007, 1031, 1055, 1079, 1103, 1127, 1151, 1175, 1199
Offset: 0

Views

Author

Omar E. Pol, Jan 21 2011

Keywords

Comments

a(n) is also the denominator of the finite algebraic formula for the number of partitions of n, if n >= 1. The formula is p(n) = Tr(n)/(24*n - 1), n >= 1. See theorem 1.1 of the Bruinier-Ono paper in the link. For the numerators see A183011.
It appears that a(n) is also the denominator of the coefficient of the third term in the n-th Bruinier-Ono "partition polynomial" H_n(x). See the Bruinier-Ono paper, chapter 5 "Examples". For the numerators see A183007. - Omar E. Pol, Jul 13 2011
Also exponents in the formula q^(-1) + q^23 + 2*q^47 + 3*q^71 + 5*q^95 + 7*q^119 + 11*q^143 + 15*q^167 + ... in which the coefficients are the partition numbers (see A000041, Example section). - Omar E. Pol, Feb 27 2013

Examples

			G.f. = -1 + 23*x + 47*x^2 + 71*x^3 + 95*x^4 + 119*x^5 + 143*x^6 + 167*x^7 + ...
		

Crossrefs

Cf. A000041, A000203, A008606, A134517 (subset of primes), A183009, A183011, A187206, A280097 (sum of divisors), A280098.
Cf. A008594.

Programs

Formula

a(n) = A008606(n) - 1.
a(1)=23, a(2)=47, a(n) = 2*a(n-1) - a(n-2). - Vincenzo Librandi, Jan 23 2011
a(n) = A183011(n)/A000041(n). - Omar E. Pol, Jul 14 2011
24 * A280098(n) = A000203(a(n)) if n>0. - Michael Somos, Dec 25 2016
E.g.f.: (24*x-1)*exp(x). - G. C. Greubel, Aug 14 2018
G.f.: (-1 + 25*x)/(1-x)^2. - Wolfdieter Lang, Dec 10 2021
a(n) = 2*A008594(n) - 1. - Leo Tavares, Jun 06 2023