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!)
A158558 a(n) = 30*n^2 + 1. 5
1, 31, 121, 271, 481, 751, 1081, 1471, 1921, 2431, 3001, 3631, 4321, 5071, 5881, 6751, 7681, 8671, 9721, 10831, 12001, 13231, 14521, 15871, 17281, 18751, 20281, 21871, 23521, 25231, 27001, 28831, 30721, 32671, 34681, 36751, 38881, 41071, 43321, 45631, 48001, 50431 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
The identity (30*n^2+1)^2 - (225*n^2+15)*(2*n)^2 = 1 can be written as a(n)^2 - A158557(n)*A005843(n)^2 = 1.
LINKS
FORMULA
G.f.: (1 + 28*x + 31*x^2)/(1 - x)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
From Amiram Eldar, Mar 09 2023: (Start)
Sum_{n>=0} 1/a(n) = (coth(Pi/sqrt(30))*Pi/sqrt(30) + 1)/2.
Sum_{n>=0} (-1)^n/a(n) = (cosech(Pi/sqrt(30))*Pi/sqrt(30) + 1)/2. (End)
MATHEMATICA
LinearRecurrence[{3, -3, 1}, {1, 31, 121}, 50] (* Vincenzo Librandi, Feb 14 2012 *)
30*Range[0, 40]^2+1 (* Harvey P. Dale, Mar 06 2013 *)
PROG
(Magma) I:=[1, 31, 121]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+1*Self(n-3): n in [1..50]]; // Vincenzo Librandi, Feb 14 2012
(PARI) for(n=0, 40, print1(30*n^2 + 1", ")); \\ Vincenzo Librandi, Feb 14 2012
CROSSREFS
Sequence in context: A256650 A131550 A360805 * A160893 A202994 A038992
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Mar 21 2009
EXTENSIONS
Comment rewritten, and a(0) added by R. J. Mathar, Oct 16 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 19 10:38 EDT 2024. Contains 371791 sequences. (Running on oeis4.)