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 A266538 #24 Aug 06 2024 14:50:51
%S A266538 0,2,4,10,12,18,28,42,44,50,60,74,92,114,140,170,172,178,188,202,220,
%T A266538 242,268,298,332,370,412,458,508,562,620,682,684,690,700,714,732,754,
%U A266538 780,810,844,882,924,970,1020,1074,1132,1194,1260,1330,1404,1482,1564,1650,1740,1834,1932,2034,2140,2250,2364,2482,2604
%N A266538 Twice the partial sums of A006257 (Josephus problem).
%H A266538 <a href="/index/J#Josephus">Index entries for sequences related to the Josephus Problem</a>.
%F A266538 a(n) = 2 * A256249(n).
%t A266538 2*Accumulate[Flatten[{0, Table[Range[1, 2^n - 1, 2], {n, 0, 7}]}]] (* _Jake L Lande_, Aug 05 2024 *)
%Y A266538 Bisection of A266540.
%Y A266538 Cf. A006257, A256249, A266535, A266540.
%K A266538 nonn,less
%O A266538 0,2
%A A266538 _Omar E. Pol_, Jan 12 2016