|
|
A081315
|
|
Lexicographically earliest sequence of positive integers such that n occurs a(n)-1 times, starting at n=0.
|
|
1
|
|
|
1, 2, 3, 2, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
EXAMPLE
|
a(2)=3 because 2 appears a total of 3 times in the two sequences: once in A001477, once as a(1) in this sequence and once as a(3). The number 2 cannot be chosen as a(2) because that would mark the third appearance of 2, creating a contradiction; neither a(2)=3 nor the subsequent a(3)=2 creates any contradiction, however.
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|