Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071289
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071289 If n mod 2 = 0 then n*(n^2+1) else (n-1/2)*(n^2+1). +0
1
0, 1, 10, 25, 68, 117, 222, 325, 520, 697, 1010, 1281, 1740, 2125, 2758, 3277, 4112, 4785, 5850, 6697, 8020, 9061, 10670, 11925, 13848, 15337, 17602, 19345, 21980, 23997, 27030, 29341, 32800, 35425, 39338, 42297, 46692, 50005, 54910, 58597, 64040, 68121, 74130 (list; graph; listen)
OFFSET

0,3

REFERENCES

T. A. Gulliver, Sequences from Arrays of Integers, Int. Math. Journal, Vol. 1, No. 4, pp. 323-332, 2002.

CROSSREFS

Adjacent sequences: A071286 A071287 A071288 this_sequence A071290 A071291 A071292

Sequence in context: A072277 A063424 A137930 this_sequence A124870 A078257 A059198

KEYWORD

nonn

AUTHOR

njas, Jun 12 2002

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research