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 A250983 #21 Mar 29 2015 13:44:17
%S A250983 1,2,2,4,4,6,6,6,6,10,10,10,10,14,14,14,14,14,14,20,20,20,20,20,20,26,
%T A250983 26,26,26,26,26,32,32,32,32,32,32,38,38,38,38,38,38,38,38,38,38,48,48,
%U A250983 48,48,48,48,48,48,48,48,58,58,58,58,58,58,58,58,58,58
%N A250983 First differences of A094589.
%C A250983 Also, a Golomb-type sequence over A094589, i.e., a sequence obtained from A094589 by repeating each term a certain number of times so that the succession of run lengths of the resulting sequence is again that same sequence.
%C A250983 Has the property of idempotence: a(a(n))=a(n).
%H A250983 Ivan Neretin, <a href="/A250983/b250983.txt">Table of n, a(n) for n = 1..10000</a>
%t A250983 w = {1, 2, 2};
%t A250983 i = 3;
%t A250983 Do[
%t A250983 w = Join[w, Array[Length[w] + 1 &, w[[i++]]]];
%t A250983 , {n, 10}
%t A250983 ];
%t A250983 w
%o A250983 (PARI) flargest(va, n) = {vsa = vecsort(va,,12); for (k=1, #vsa, if (vsa[k] < n, return (vsa[k])););}
%o A250983 lista(nn) = {voa = [1]; for (n=2, nn, newoa = flargest(voa, n) + voa[n-1]; print1(newoa - voa[n-1], ", "); voa = concat(voa, newoa););} \\ _Michel Marcus_, Mar 24 2015
%Y A250983 Cf. A094589 (a(n) with repetitions removed), A001462 (Golomb's sequence), A013189 (Golomb's sequence over squares).
%K A250983 nonn,easy
%O A250983 1,2
%A A250983 _Ivan Neretin_, Mar 20 2015
%E A250983 More terms from _Michel Marcus_, Mar 24 2015