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 A248913 #13 Nov 29 2014 21:10:00
%S A248913 1,1,2,2,4,2,4,2,2,2,6,2,6,4,2,2,2,2,4,6,2,6,4,2,6,2,2,2,4,2,2,4,4,2,
%T A248913 4,2,2,2,4,4,6,4,2,4,2,2,4,4,2,6,6,2,2,6,2,2,2,2,10,2,4,2,2,4,4,2,2,4,
%U A248913 4,2,4,2,2,2,2,4,2,6,4,2,4,4,2,2,4,2
%N A248913 A248614(n+1) - A248614(n).
%C A248913 From Bernoulli numbers A027642.
%C A248913 The first different numbers of a(n), i.e., 1, 2, 4, 6, 10, ... = A248614(1, 2, 3, 4, 5, ...) are at rank 0, 2, 4, 10, 58, ... .
%H A248913 Michel Marcus, <a href="/A248913/b248913.txt">Table of n, a(n) for n = 0..842</a>
%H A248913 <a href="/index/Be#Bernoulli">Index entries for sequences related to Bernoulli numbers</a>
%o A248913 (PARI) lista() = {vbden = readvec("c:/gp/bfiles/b027642.txt"); vredu = readvec("c:/gp/bfiles/b090126.txt"); vrank = []; for (i=1, #vredu, val = vredu[i]; k = 1; while(vbden[k] != val, k++); vrank = concat(vrank, k-1);); for (i=2, #vrank, print1(vrank[i] - vrank[i-1], ", "););} \\ _Michel Marcus_, Nov 08 2014
%Y A248913 Cf. A027642, A090126, A248614.
%K A248913 nonn
%O A248913 0,3
%A A248913 _Paul Curtz_, Oct 16 2014
%E A248913 More terms from _Michel Marcus_, Nov 08 2014