|
Search: id:A067255
|
|
|
| A067255 |
|
Exponents from prime factorizations. |
|
+0
4
|
|
| 0, 1, 0, 1, 2, 0, 0, 1, 1, 1, 0, 0, 0, 1, 3, 0, 2, 1, 0, 1, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 4, 0, 0, 0, 0, 0, 0, 1, 1, 2, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 3, 1, 0, 0, 2, 1, 0, 0, 0, 0, 1, 0, 3, 2, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
Lengths of the runs are given by A061395(n),n>=2: [1,2,1,3,2,4,1,2,... ].
This sequence contains every finite sequence of nonnegative integers. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jun 22 2005
|
|
LINKS
|
Jeppe Stig Nielsen, See this explanation.
|
|
EXAMPLE
|
1 = 2^0
2 = 2^1
3 = 2^0 3^1
4 = 2^2
5 = 2^0 3^0 5^1
6 = 2^1 3^1
..., and reading the exponents gives the sequence.
Since for example 99=2^0*3^2*5^0*7^0*11^1, we use this symbol for ninety-nine: 99: {0,2,0,0,1}. Concatenating all the symbols for 1,2,3,4,5,6,..., we get the sequence.
|
|
CROSSREFS
|
Cf. A133457.
Adjacent sequences: A067252 A067253 A067254 this_sequence A067256 A067257 A067258
Sequence in context: A001842 A029429 A064559 this_sequence A065716 A079409 A114643
|
|
KEYWORD
|
easy,nonn,tabf
|
|
AUTHOR
|
Jeppe Stig Nielsen (sequence(AT)jeppesn.dk), Feb 20 2002
|
|
|
Search completed in 0.002 seconds
|
