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!)
A157367 a(n) = 4802*n^2 + 196*n + 1. 3
4999, 19601, 43807, 77617, 121031, 174049, 236671, 308897, 390727, 482161, 583199, 693841, 814087, 943937, 1083391, 1232449, 1391111, 1559377, 1737247, 1924721, 2121799, 2328481, 2544767, 2770657, 3006151, 3251249, 3505951 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The identity (4802*n^2+196*n+1)^2-(49*n^2+2*n)*(686*n+14)^2=1 can be written as a(n)^2-A157365(n)*A157366(n)^2=1.
This formula is the case s=7 of the identity (2*s^4*n^2+4*s^2*n+1)^2-(s^2*n^2+2*n)*(2*s^3*n+2*s)^2=1. - Bruno Berselli, Feb 11 2012
LINKS
FORMULA
G.f: x*(4999 + 4604*x + x^2)/(1-x)^3.
a(n) = 3*a(n-1) -3*a(n-2) +a(n-3).
E.g.f.: (1 + 4998*x + 4802*x^2)*exp(x) - 1. - G. C. Greubel, Feb 02 2018
EXAMPLE
For n=1, a(1)=4999; n=2, a(2)=19601; n=3, a(3)=43807
MATHEMATICA
LinearRecurrence[{3, -3, 1}, {4999, 19601, 43807}, 50]
PROG
(Magma) I:=[4999, 19601, 43807]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+1*Self(n-3): n in [1..40]];
(PARI) a(n) = 4802*n^2+196*n+1.
CROSSREFS
Sequence in context: A031840 A059667 A106767 * A200910 A035901 A203919
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Feb 28 2009
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 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)