|
Search: id:A108730
|
|
|
| A108730 |
|
Triangle read by rows: row n gives list of number of zeros following each 1 in binary representation of n. |
|
+0
4
|
|
| 0, 1, 0, 0, 2, 1, 0, 0, 1, 0, 0, 0, 3, 2, 0, 1, 1, 1, 0, 0, 0, 2, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 4, 3, 0, 2, 1, 2, 0, 0, 1, 2, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 3, 0, 2, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 2, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 5, 4, 0, 3, 1, 3, 0, 0, 2, 2, 2, 1, 0, 2, 0, 1, 2, 0, 0, 0, 1, 3, 1, 2, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
This is probably the simplest method for putting the nonnegative integers into one-to-one correspondence with the finite sequences of nonnegative integers and is the standard ordering for such sequences in this database.
This sequence contains every finite sequence of nonnegative integers.
This can be regarded as a table in two ways: with each composition as a row, or with the compositions of each integer as a row. The first way has A000120 as row lengths and A080791 as row sums; the second has A001792 as row lengths and A001787 as row sums. - Franklin T. Adams-Watters, Nov 06 2006
|
|
LINKS
|
Franklin T. Adams-Watters, Table of n, a(n) for n = 1..5120 (through 10 bit numbers)
|
|
EXAMPLE
|
Triangle begins:
0
1
0,0
2
1,0
0,1
0,0,0
3
For example, 25 base 2 = 11001; following the 1's are 0, 2 and 0 zeros, so row 25 is 0, 2, 0.
|
|
CROSSREFS
|
Cf: A066099, A007088, A000120, A080791, A001792, A001787, A124735.
Sequence in context: A103840 A066301 A046660 this_sequence A056973 A107782 A086017
Adjacent sequences: A108727 A108728 A108729 this_sequence A108731 A108732 A108733
|
|
KEYWORD
|
easy,nice,nonn,tabf
|
|
AUTHOR
|
Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jun 22 2005
|
|
EXTENSIONS
|
Edited by Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Nov 06 2006
|
|
|
Search completed in 0.002 seconds
|
