|
Search: id:A001650
|
|
|
| A001650 |
|
n appears n times (n odd). |
|
+0 6
|
|
| 1, 3, 3, 3, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 9, 9, 9, 9, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
For n >= 0, a(n+1) is the number of integers x with |x| <= sqrt(n), or equivalently the number of point in the Z^1 lattice of norm <= n+1. - David W. Wilson, Oct 22 2006
|
|
REFERENCES
|
J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 106.
|
|
FORMULA
|
a(n) = 1 + 2*floor(sqrt(n-1)), n > 0. - Antonio Esposito (antonio.b.esposito(AT)italtel.it), Jan 21 2002
G.f.: theta_3(x)*x/(1-x). a(n+1)=a(n)+A000122(n). - Michael Somos, Apr 29 2003.
|
|
PROGRAM
|
(PARI) a(n)=if(n<1, 0, 1+2*sqrtint(n-1))
|
|
CROSSREFS
|
Cf. A001670. Partial sums of A000122.
Sequence in context: A136800 A126661 A162226 this_sequence A130175 A101290 A080605
Adjacent sequences: A001647 A001648 A001649 this_sequence A001651 A001652 A001653
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Michael Somos, Apr 29 2003.
|
|
|
Search completed in 0.002 seconds
|