login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052462 a(n) is the minimal positive integral solution k to 24*k == 1 (mod 5^n). 5
4, 24, 99, 599, 2474, 14974, 61849, 374349, 1546224, 9358724, 38655599, 233968099, 966389974, 5849202474, 24159749349, 146230061849, 603993733724, 3655751546224, 15099843343099, 91393788655599, 377496083577474 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Related to a Ramanujan congruence for the partition function P = A000041.

Extending work of Ramanujan, Watson (1938) proved that P(m) == 0 (mod 5^n) if 24*m == 1 (mod 5^n). In particular, P(a(n)) == 0 (mod 5^n). - Petros Hadjicostas, Jul 29 2020

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

G. N. Watson, Ramanujans Vermutung √ľber Zerf√§llungsanzahlen, J. Reine Angew. Math. (Crelle), 179 (1938), 97-128.

Eric Weisstein's World of Mathematics, Partition Function P Congruences.

Index entries for linear recurrences with constant coefficients, signature (1,25,-25).

FORMULA

G.f.: x*(-25*x^2 + 20*x + 4)/((1 - x)*(1 - 5*x)*(1 + 5*x)).

a(n) = (1 + (21 + 2*(-1)^n)*5^n)/24.  - Bruno Berselli, Apr 04 2011

a(n) = a(n-1) + 25*a(n-2) - 25*a(n-3). - Vincenzo Librandi, Jul 01 2012

A000041(a(n)) == 0 (mod 5^n). - Petros Hadjicostas, Jul 29 2020

EXAMPLE

From Petros Hadjicostas, Jul 29 2020: (Start)

A000041(a(1)) = A000041(4) = 5 == 0 (mod 5).

A000041(a(2)) = A000041(24) = 1575 == 0 (mod 5^2).

A000041(a(3)) = A000041(99) = 169229875 == 0 (mod 5^3).

A000041(a(4)) = A000041(599) = 435350207840317348270000 == 0 (mod 5^4). (End)

MATHEMATICA

Table[PowerMod[24, -1, 5^a], {a, 21}]

CoefficientList[Series[(-25x^2+20x+4)/((1-x)(1-5x)(1+5x)), {x, 0, 30}], x] (* Vincenzo Librandi, Jul 01 2012 *)

PROG

(MAGMA) I:=[4, 24, 99]; [n le 3 select I[n] else Self(n-1)+25*Self(n-2)-25*Self(n-3): n in [1..30]]; // Vincenzo Librandi, Jul 01 2012

(PARI) a(n) = lift(Mod(24, 5^n)^-1) \\ David A. Corneth and Petros Hadjicostas, Jul 29 2020

CROSSREFS

Cf. A000041, A052463, A052465, A052466.

Sequence in context: A100738 A139238 A139231 * A260217 A048806 A043009

Adjacent sequences:  A052459 A052460 A052461 * A052463 A052464 A052465

KEYWORD

nonn,easy

AUTHOR

Eric W. Weisstein

EXTENSIONS

Name edited by Petros Hadjicostas, Jul 29 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 10:36 EST 2021. Contains 340343 sequences. (Running on oeis4.)