login
A275668
First occurrence of a value in A268755: a(i) = j iff A268755(j) = i-1 and A268755(j+1) = 0.
2
1, 3, 5, 10, 12, 15, 33, 35, 39, 42, 45, 50, 58, 68, 75, 117, 119, 164, 180, 189, 194, 216, 236, 246, 249, 259, 262, 389, 391, 404, 420, 501, 552, 604, 609, 658, 825, 827, 888, 910, 946, 1035, 1049, 1088, 1160, 1229, 1279, 1535, 1537, 1577, 1600, 1603, 1613, 1652, 1677, 1687, 1736, 1744, 1784, 1796, 1847, 1910, 1975, 2214, 2397, 2426, 2561, 2615, 2629
OFFSET
1,2
COMMENTS
Observe that a value k can appear in A268755 only after 0,1,...,k-1 have already appeared. This means that this sequence is strictly increasing.
Conjectured to be infinite (this is equivalent to the conjecture that every positive integer eventually appears in A268755). (Proof given in comments of A268755).
How fast does it grow? Experimentally, it seems like a(n) ~ n^t, with 1 < t <= 2.
LINKS
EXAMPLE
For n = 4, a(4) = 10, since the value 3 first appears in A268755 at position 10.
CROSSREFS
Sequence in context: A284959 A336531 A285415 * A212537 A047389 A263652
KEYWORD
nonn
AUTHOR
László Kozma, Aug 04 2016
STATUS
approved