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!)
A100555 Smallest square that is equal to the sum of n not-necessarily-distinct primes plus 1. 4

%I #4 Mar 30 2012 18:39:59

%S 1,4,9,9,9,16,16,16,25,25,25,25,25,36,36,36,36,36,49,49,49,49,49,49,

%T 49,64,64,64,64,64,64,64,81,81,81,81,81,81,81,81,81,100,100,100,100,

%U 100,100,100,100,100,121,121,121,121,121,121,121,121,121,121,121,144,144

%N Smallest square that is equal to the sum of n not-necessarily-distinct primes plus 1.

%e a(1)=4 because 2^2=1+3.

%e a(2)=9 because 3^2=1+3+5.

%e a(3)=9 because 3^2=1+2+3+3.

%e a(4)=9 because 3^2=1+2+2+2+2.

%Y Cf. A100498, A101776-A101778.

%K nonn

%O 0,2

%A _Giovanni Teofilatto_, Dec 31 2004

%E Corrected and extended by _Ray Chandler_, Jan 10 2005

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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)