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 A107263 #15 Nov 12 2024 22:19:52
%S A107263 20678,95695,120724,133876,1148205
%N A107263 Position where n (presumably) appears the last time in A032531, or 0 if n keeps appearing.
%C A107263 The sequence resulted from analysis of A032531(n), n<= 2*10^6.
%C A107263 We can only speak of provisional values and, in the absence of any proof, I am not sure how rigorous these results are for n > 2*10^6. - Herman Jamke (hermanjamke(AT)fastmail.fm), Nov 03 2006
%C A107263 I extended the analysis of A032531(n) to all n<= 10^7. Same comments apply considering the new limit and, of course, the uniqueness of Stephan's sequence remains as always only a conjecture since there's no proof that the sequence should be anything different from the zero sequence for all, most or even any of the terms - Herman Jamke (hermanjamke(AT)fastmail.fm), Nov 08 2006
%C A107263 Search extended to the first 10^9 terms of A032531. - _Andrew Howroyd_, Nov 12 2024
%o A107263 (PARI) \\ Warning: conjectured sequence.
%o A107263 accrows(n)={my(v=vector(n), p=vector(n), idx=0); for(i=1, n, for(j=1, i, my(t=v[j]+1); if(t<=n, v[t]++; p[t]=idx); idx++)); p}
%o A107263 \\ search 5000 rows of A032531 (first binomial(5000+1,2) = 12502500 terms).
%o A107263 { accrows(5000)[1..31] } \\ _Andrew Howroyd_, Nov 12 2024
%Y A107263 Cf. A107262.
%K A107263 nonn,hard,more
%O A107263 0,1
%A A107263 _Ralf Stephan_, May 15 2005
%E A107263 Corrected and extended by Herman Jamke (hermanjamke(AT)fastmail.fm), Nov 03 2006, Nov 08 2006