OFFSET
1,5
COMMENTS
Write 0 followed by segments defined inductively as follows: each segment tells how many times each previously written integer occurs, stating first the integer being counted and then its frequency. This is Method B (noun-before-adjective); for Method A (adjective-before-noun), see A217760. - Clark Kimberling, Mar 25 2013
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..10000
EXAMPLE
Start with 0, then 0,1; then 2,0 and 1,1; etc.
Writing pairs vertically, the initial segments are
0..0..0 1..0 1 2..0 1 2 3..0 1 2 3 4 5..0 1 2 3 4 5 6..0 1 2 3 4 5 6 9
...1..2 1..3 3 1..4 5 2 2..5 6 5 3 1 1..6 9 6 5 2 4 1..7 11 8 6 4 6 3 1
The 5th segment tells that 0 has been written 4 times, 1 5 times, 2 2 times, and 3 2 times. The nouns are 1 2 3; the adjectives, 5 2 2. - Clark Kimberling, Mar 25 2013
MATHEMATICA
s = {0}; Do[s = Flatten[{s, {#, Count[s, #]} & /@ DeleteDuplicates[s]}], {24}]; s (* Peter J. C. Moses, Mar 21 2013 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, Apr 27 2000
EXTENSIONS
Conjecture removed by Clark Kimberling, Oct 24 2009
STATUS
approved