|
Search: id:A131789
|
|
|
| A131789 |
|
a(n) = the length of the n-th run of similar consecutive values in the sequence A000005. (A000005(n) = the number of positive divisors of n.). |
|
+0
2
|
|
| 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
Runs of sequence A000005: (1), (2,2), (3), (2), (4), (2), (4), (3), (4), (2), (6), (2), (4,4), (5), (2), (6), (2), (6), (4,4), (2), (8), (3),...
|
|
CROSSREFS
|
Cf. A000005, A131790.
Sequence in context: A030575 A043284 A083230 this_sequence A108465 A069347 A113607
Adjacent sequences: A131786 A131787 A131788 this_sequence A131790 A131791 A131792
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jul 15 2007
|
|
EXTENSIONS
|
More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), Jul 18 2007
|
|
|
Search completed in 0.002 seconds
|
