Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060822
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060822 a(n) = p(n) + n^2 + n^3 + (2*n-1) + (2*n) where p(n) is n-th prime. +0
1
7, 22, 52, 102, 180, 288, 436, 626, 868, 1168, 1526, 1956, 2458, 3038, 3706, 4468, 5328, 6288, 7362, 8550, 9858, 11298, 12870, 14584, 16446, 18456, 20622, 22954, 25454, 28132, 31002, 34050, 37294, 40734, 44388, 48246, 52326, 56630, 61162 (list; graph; listen)
OFFSET

1,1

REFERENCES

Marilyn vos Savant and Leonore Fleischer, Brain Building in Just 12 Weeks, Bantam Books, New York, NY, 1991, pp. 104-105, 119.

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

EXAMPLE

a(2)=22 because 3 + 2^2 + 2^3 + 3 + 4 = 22.

PROGRAM

(PARI) { n=0; forprime (p=2, prime(1000), write("b060822.txt", n++, " ", p + n^2 + n^3 + (2*n - 1) + (2*n)); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 12 2009]

CROSSREFS

Sequence in context: A129109 A002412 A041215 this_sequence A011926 A101120 A151717

Adjacent sequences: A060819 A060820 A060821 this_sequence A060823 A060824 A060825

KEYWORD

easy,nonn,dumb

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), May 05 2001

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), May 07 2001

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research