login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324269 a(n) = 3*11^(2*n). 1
3, 363, 43923, 5314683, 643076643, 77812273803, 9415285130163, 1139249500749723, 137849189590716483, 16679751940476694443, 2018249984797680027603, 244208248160519283339963, 29549198027422833284135523, 3575452961318162827380398283, 432629808319497702113028192243 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
x = A324268(n) and y = a(n) satisfy the Lebesgue-Ramanujan-Nagell equation x^2 + 11^(10*n+1) = 4*y^5 (see Theorem 2.1 in Chakraborty, Hoque and Sharma).
LINKS
K. Chakraborty, A. Hoque, R. Sharma, Complete solutions of certain Lebesgue-Ramanujan-Nagell type equations, arXiv:1812.11874 [math.NT], 2018.
FORMULA
O.g.f.: 3/(1 - 121*x).
E.g.f.: 3*exp(121*x).
a(n) = 121*a(n-1) for n > 0.
a(n) = 3*121^n.
a(n) = 3*A001020(n)^2.
EXAMPLE
For A324268(0) = 31 and a(0) = 3, 31^2 + 11 = 972 = 4*3^5.
MAPLE
a:=n->3*121^n: seq(a(n), n=0..20);
MATHEMATICA
3 121^Range[0, 20]
PROG
(GAP) List([0..20], n->3*121^n);
(Magma) [3*121^n: n in [0..20]];
(PARI) a(n) = 3*121^n;
CROSSREFS
Cf. A324268: 31*11^(5*n); A000290: n^2; A000584: n^5; A001020: 11^n.
Sequence in context: A324402 A324427 A304285 * A173648 A110717 A068988
KEYWORD
nonn,easy
AUTHOR
Stefano Spezia, Feb 27 2019
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:12 EDT 2024. Contains 371969 sequences. (Running on oeis4.)