|
| |
|
|
A159913
|
|
2^(A000120(n)+1)-1, where A000120(n) = number of nonzero bits in n.
|
|
4
| |
|
|
1, 3, 3, 7, 3, 7, 7, 15, 3, 7, 7, 15, 7, 15, 15, 31, 3, 7, 7, 15, 7, 15, 15, 31, 7, 15, 15, 31, 15, 31, 31, 63, 3, 7, 7, 15, 7, 15, 15, 31, 7, 15, 15, 31, 15, 31, 31, 63, 7, 15, 15, 31, 15, 31, 31, 63, 15, 31, 31, 63, 31, 63, 63, 127, 3, 7, 7, 15, 7, 15, 15, 31, 7, 15, 15, 31, 15, 31, 31
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Essentially the same sequence as A117973 and A001316. The latter entry has much more information. - N. J. A. Sloane, Jun 05 2009
First differences of A159912; every other term of A038573.
Contribution from Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 16 2009: (Start)
Equals Sierpinski's gasket, A047999; as an infinite lower triangular matrix
* [1,2,2,2,...] as a vector. (End)
|
|
|
FORMULA
| a(n) = 2^A000120(2n+1)-1 = A038573(2n+1) = 2 A038573(n)+1 = A159912(n+1) - A159912(n)
a(n)=A160019(n,n). - From DELEHAM Philippe, Nov 15 2011
|
|
|
PROG
| (PARI) A159913(n)=2<<norml2(binary(n))-1
|
|
|
CROSSREFS
| Rows of triangle in A038573 converge to this sequence. - N. J. A. Sloane, Jun 05 2009
Cf. A000120, A038573, A159912, A117973, A001316.
A047999 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 16 2009]
Sequence in context: A096915 A100803 A036840 * A183061 A172097 A030316
Adjacent sequences: A159910 A159911 A159912 * A159914 A159915 A159916
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| M. F. Hasler (www.univ-ag.fr/~mhasler), May 03 2009
|
| |
|
|
