The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A135176 5^p + 3^p + 2^p, where p = prime(n). 1

%I #10 Sep 08 2022 08:45:32

%S 38,160,3400,80440,49007320,1222305640,763068724360,19074649113880,

%T 11921023106645560,186264583554009938920,4656613490752936345720,

%U 72759576592118302363153960,45474735125119410471945995080,1136868377544417273584428927960,710542735786689000370819259221240

%N 5^p + 3^p + 2^p, where p = prime(n).

%H Vincenzo Librandi, <a href="/A135176/b135176.txt">Table of n, a(n) for n = 1..200</a>

%F p=A000040(n): a(n)= 5^p + 3^p + 2^p.

%e a(4)=80440 because the 4th prime number is 7, 5^7=78125, 3^7=2187, 2^7=128 and 78125+2187+128=80440.

%t Table[5^p + 3^p + 2^p, {p, Prime[Range[20]]}] (* _Vincenzo Librandi_, May 24 2014 *)

%o (Magma)[5^p+3^p+2^p: p in PrimesUpTo(100)]; // _Vincenzo Librandi_ Dec 14 2010

%Y Cf. 2^p: A034785. 3^p: A057901. 2^5: A057902.

%K nonn,easy

%O 1,1

%A _Omar E. Pol_, Nov 25 2007

%E More terms from _Vincenzo Librandi_, Dec 14 2010

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

Last modified September 19 13:29 EDT 2024. Contains 376012 sequences. (Running on oeis4.)