This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A275668 #27 Aug 05 2016 10:35:15 %S A275668 1,3,5,10,12,15,33,35,39,42,45,50,58,68,75,117,119,164,180,189,194, %T A275668 216,236,246,249,259,262,389,391,404,420,501,552,604,609,658,825,827, %U A275668 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 %N A275668 First occurrence of a value in A268755: a(i) = j iff A268755(j) = i-1 and A268755(j+1) = 0. %C A275668 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. %C A275668 Conjectured to be infinite (this is equivalent to the conjecture that every positive integer eventually appears in A268755). (Proof given in comments of A268755). %C A275668 How fast does it grow? Experimentally, it seems like a(n) ~ n^t, with 1 < t <= 2. %H A275668 László Kozma, <a href="/A275668/b275668.txt">Table of n, a(n) for n = 1..1001</a> %e A275668 For n = 4, a(4) = 10, since the value 3 first appears in A268755 at position 10. %Y A275668 Cf. A268755, A181391. %K A275668 nonn %O A275668 1,2 %A A275668 _László Kozma_, Aug 04 2016