cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A133064 a(n) = 5*p^5 + 3*p^3 + 2*p^2, where p = prime(n).

This page as a plain text file.
%I A133064 #16 Sep 08 2022 08:45:31
%S A133064 192,1314,16050,85162,809490,1863394,7114602,12401794,32219274,
%T A133064 102630594,143237050,346874482,579491130,735284434,1147040922,
%U A133064 2091429714,3575244594,4223669890,6751536802,9022230570,10366535674,15386773594,19696932354,27922427994,42939458122,52553613810
%N A133064 a(n) = 5*p^5 + 3*p^3 + 2*p^2, where p = prime(n).
%F A133064 a(n) = 5*prime(n)^5 + 3*prime(n)^3 + 2*prime(n)^2, where prime(n)= A000040(n).
%e A133064 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.
%t A133064 5#^5+3#^3+2#^2&/@Prime[Range[30]] (* _Harvey P. Dale_, Dec 17 2011 *)
%o A133064 (Magma) [5*p^5+3*p^3+2*p^2: p in PrimesUpTo(200)] // _Vincenzo Librandi_, Dec 15 2010
%o A133064 (PARI) a(n) = my(p=prime(n)); 5*p^5 + 3*p^3 + 2*p^2; \\ _Michel Marcus_, Mar 11 2022
%Y A133064 Cf. A000290, A000578, A000584, A045991, A133073, A000040 (prime numbers).
%K A133064 nonn
%O A133064 1,1
%A A133064 _Omar E. Pol_, Nov 05 2007
%E A133064 More terms from _Vincenzo Librandi_, Dec 15 2010