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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098823 a(n) = 16*(8*prime(n) + 7). 0

%I #11 Aug 26 2015 23:35:49

%S 368,496,752,1008,1520,1776,2288,2544,3056,3824,4080,4848,5360,5616,

%T 6128,6896,7664,7920,8688,9200,9456,10224,10736,11504,12528,13040,

%U 13296,13808,14064,14576,16368,16880,17648,17904,19184,19440,20208,20976

%N a(n) = 16*(8*prime(n) + 7).

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem</a>

%e 4^2 * (8*2 + 7) = 368 when p=2.

%t Table[16*(8*Prime[n] + 7), {n, 1, 40}] (* _Stefan Steinerberger_, Mar 06 2006 *)

%o (PARI) main(m)=forprime(p=2,m,print1(16 * (8 * p + 7),", ")) \\ _Anders Hellström_, Aug 26 2015

%Y Cf. A018889, A002804.

%K nonn

%O 1,1

%A _Parthasarathy Nambi_, Oct 08 2004

%E More terms from _Stefan Steinerberger_, Mar 06 2006

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 04:31 EDT 2024. Contains 371767 sequences. (Running on oeis4.)