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!)
A006222 11*n^2 + 11*n + 3.
(Formerly M3109)
1
3, 25, 69, 135, 223, 333, 465, 619, 795, 993, 1213, 1455, 1719, 2005, 2313, 2643, 2995, 3369, 3765, 4183, 4623, 5085, 5569, 6075, 6603, 7153, 7725, 8319, 8935, 9573, 10233, 10915, 11619, 12345, 13093, 13863, 14655, 15469, 16305 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
REFERENCES
G. V. Chudnovsky, Transcendental numbers, pp. 45-69 of Number Theory Carbondale 1979, Lect. Notes Math. 751 (1982).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
FORMULA
G.f.:(3+16*x+3*x^2)/(1-x)^3. - Vincenzo Librandi, Jul 07 2012
a(n) = 3*a(n-1) -3*a(n-2) +a(n-3). - Vincenzo Librandi, Jul 07 2012
MAPLE
A006222:=-(3+16*z+3*z**2)/(z-1)**3; [Simon Plouffe in his 1992 dissertation.]
MATHEMATICA
CoefficientList[Series[(3+16*x+3*x^2)/(1-x)^3, {x, 0, 50}], x] (* Vincenzo Librandi, Jul 07 2012 *)
PROG
(Magma) I:=[3, 25, 69]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+Self(n-3): n in [1..50]]; // Vincenzo Librandi, Jul 07 2012
(PARI) a(n)=11*n^2+11*n+3 \\ Charles R Greathouse IV, Jun 17 2017
CROSSREFS
Sequence in context: A041897 A356594 A242974 * A290165 A129443 A083298
KEYWORD
nonn,easy
AUTHOR
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 20 12:18 EDT 2024. Contains 371839 sequences. (Running on oeis4.)