|
|
|
|
|
|
|
|
|
#37 by Michel Marcus at Sat Oct 01 06:15:18 EDT 2022
|
|
|
|
|
|
|
|
#36 by Joerg Arndt at Sat Oct 01 04:13:57 EDT 2022
|
|
|
|
|
|
|
|
#35 by Amiram Eldar at Sat Oct 01 03:47:09 EDT 2022
|
|
|
|
|
|
|
|
#34 by Amiram Eldar at Sat Oct 01 03:18:52 EDT 2022
|
|
|
|
|
|
|
|
#33 by Alois P. Heinz at Fri Jul 29 20:36:47 EDT 2022
|
|
|
|
|
|
|
|
#32 by Alois P. Heinz at Fri Jul 29 20:36:44 EDT 2022
|
|
| FORMULA
|
a(n) = 1 + 2*floor(sqrt(n-1)), n > 0. - . - _Antonio Esposito (antonio.b.esposito(AT)italtel.it), _, Jan 21 2002
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#31 by Michael De Vlieger at Tue Feb 01 23:40:19 EST 2022
|
|
|
|
|
|
|
|
#30 by Jon E. Schoenfield at Tue Feb 01 23:26:35 EST 2022
|
|
|
|
|
|
|
|
#29 by Jon E. Schoenfield at Tue Feb 01 23:26:32 EST 2022
|
|
| NAME
|
nk appears nk times (nk odd).
|
|
| COMMENTS
|
For n >= 0, a(n+1) is the number of integers x with |x| <= sqrt(n), or equivalently the number of pointpoints in the Z^1 lattice of norm <= n+1. - David W. Wilson, Oct 22 2006
|
|
| FORMULA
|
From Michael Somos, Apr 29 2003: (Start)
G.f.: theta_3(x)*x/(1-x). a(n+1)=a(n)+A000122(n). - _Michael Somos_, Apr 29 2003.).
a(n+1) = a(n) + A000122(n). (End)
a(n) = 2*ceiling(sqrt(n))-)) - 1. - Branko Curgus, May 07 2010
|
|
| AUTHOR
|
_N. J. A. Sloane_._
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#28 by Joerg Arndt at Tue Jan 28 12:09:56 EST 2020
|
|
|
|
|
|
|
