Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133064
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133064 5*p^5 + 3*p^3 + 2*p^2. Coefficients and exponents are the prime numbers in decreasing order and p is the n-th prime. +0
1
192, 1314, 16050, 85162, 809490, 1863394, 7114602 (list; graph; listen)
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)=85162 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=85162.

CROSSREFS

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

Sequence in context: A051527 A101451 A094949 this_sequence A051526 A154308 A035833

Adjacent sequences: A133061 A133062 A133063 this_sequence A133065 A133066 A133067

KEYWORD

nonn

AUTHOR

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

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research