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!)
A017498 a(n) = (11*n + 9)^2. 12
81, 400, 961, 1764, 2809, 4096, 5625, 7396, 9409, 11664, 14161, 16900, 19881, 23104, 26569, 30276, 34225, 38416, 42849, 47524, 52441, 57600, 63001, 68644, 74529, 80656, 87025, 93636, 100489, 107584, 114921, 122500, 130321, 138384, 146689, 155236, 164025 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
FORMULA
a(0)=81, a(1)=400, a(2)=961, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, Oct 30 2011
From G. C. Greubel, Oct 28 2019: (Start)
G.f.: (81 + 157*x +4*x^2)/(1-x)^3.
E.g.f.: (81 + 319*x + 121*x^2)*exp(x). (End)
MAPLE
seq((11*n+9)^2, n=0..30); # G. C. Greubel, Oct 28 2019
MATHEMATICA
(11Range[0, 30]+9)^2 (* or *) LinearRecurrence[{3, -3, 1}, {81, 400, 961}, 30] (* Harvey P. Dale, Oct 30 2011 *)
PROG
(PARI) a(n)=(11*n+9)^2 \\ Charles R Greathouse IV, Jun 17 2017
(Magma) [(11*n+9)^2: n in [0..30]]; // G. C. Greubel, Oct 28 2019
(Sage) [(11*n+9)^2 for n in (0..30)] # G. C. Greubel, Oct 28 2019
(GAP) List([0..30], n-> (11*n+9)^2 ); # G. C. Greubel, Oct 28 2019
CROSSREFS
Powers of the form (11*n+9)^m: A017497 (m=1), this sequence (m=2), A017499 (m=3), A017500 (m=4), A017501 (m=5), A017502 (m=6), A017503 (m=7), A017504 (m=8), A017505 (m=9), A017506 (m=10), A017607 (m=11), A017508 (m=12).
Sequence in context: A236712 A206542 A206535 * A097025 A074387 A008848
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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)