Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115565
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115565 5*n^4 - 10*n^3 + 20*n^2 - 15*n + 11. +0
1
11, 61, 281, 911, 2311, 4961, 9461, 16531, 27011, 41861, 62161, 89111, 124031, 168361, 223661, 291611, 374011, 472781, 589961, 727711, 888311, 1074161, 1287781, 1531811, 1809011, 2122261, 2474561, 2869031, 3308911, 3797561, 4338461, 4935211, 5591531 (list; graph; listen)
OFFSET

1,1

FORMULA

a(1-n) = a(n) = 5*(n^2-n)^2 +15*(n^2-n) +11. - Michael Somos May 15 2006

PROGRAM

ay1[1] := 11; a[1] :=50; b[1] :=170; c[1] :=240; k := 120; Repeat ay1[1] := ay1[1] + a[1]; a[1] := a[1] + b[1]; b[1] := b[1] + c[1]; c[1] := c[1] + k; writeln(ay1[1]); Until 1 < 0;

CROSSREFS

Sequence in context: A089764 A023298 A106992 this_sequence A137410 A156095 A068846

Adjacent sequences: A115562 A115563 A115564 this_sequence A115566 A115567 A115568

KEYWORD

nonn

AUTHOR

Aldrich Stevens (Aldrichstevens(AT)msn.com), Mar 11 2006

EXTENSIONS

Checked by N. J. A. Sloane (njas(AT)research.att.com), Mar 29 2006

Edited by N. J. A. Sloane (njas(AT)research.att.com), Jun 13 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 23:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research