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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133061 5*p^5 - 3*p^3 - 2*p^2, where p = prime(n). 0
128, 1116, 15200, 82908, 801020, 1849536, 7083968, 12359196, 32144156, 102480896, 143054460, 346565088, 579070880, 734799996, 1146409148, 2090525216, 3573998396, 4222293120, 6749714268, 9020062940, 10364180256, 15383790396, 19693474076, 27918166496, 42933944448, 52547391200 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

FORMULA

a(n) = 5*(p(n))^5 - 3*(p)n))^3 - 2*(p(n))^2, where p(n)=A000040(n).

EXAMPLE

a(4)=82908 because the 4th prime is 7, 5*7^5=84035, 3*7^3=1029, 2*7^2=98 and we can write 84035-1029-98=82908.

PROG

(MAGMA)[5*p^5-3*p^3-2*p^2: p in PrimesUpTo(200)][From Vincenzo Librandi, Dec 15 2010]

CROSSREFS

Cf. A000290, A000578, A000584, A045991, A133070. Prime numbers: A000040.

Sequence in context: A206278 A100628 A134630 * A188822 A181211 A070055

Adjacent sequences:  A133058 A133059 A133060 * A133062 A133063 A133064

KEYWORD

nonn

AUTHOR

Omar E. Pol (info(AT)polprimos.com), Nov 05 2007

EXTENSIONS

More terms from Vincenzo Librandi, Dec 15 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 00:09 EST 2012. Contains 205978 sequences.