login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060822 a(n) = prime(n) + n^3 + n^2 + 4n - 1. 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, 65932, 70944 (list; graph; refs; listen; history; text; internal format)
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

FORMULA

a(n) ~ n^3. - Charles R Greathouse IV, May 30 2013

EXAMPLE

a(2)=22 because 3 + 2^3 + 2^2 + 8 - 1 = 22.

MATHEMATICA

Table[Prime[n] + n^3 + n^2 + 4 n - 1, {n, 50}] (* Vincenzo Librandi, Jul 03 2018 *)

PROG

(PARI) a(n)={prime(n) + n^2 + n^3 + (2*n - 1) + (2*n)} \\ Harry J. Smith, Jul 12 2009

(MAGMA) [NthPrime(n)+n^3 + n^2 + 4*n - 1: n in [1..50]]; // Vincenzo Librandi, Jul 03 2018

CROSSREFS

Sequence in context: A211634 A184629 A041215 * A011926 A101120 A151717

Adjacent sequences:  A060819 A060820 A060821 * A060823 A060824 A060825

KEYWORD

easy,nonn,dumb

AUTHOR

Jason Earls, May 05 2001

EXTENSIONS

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 04:47 EST 2019. Contains 319269 sequences. (Running on oeis4.)