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 A113744 #9 Jun 23 2020 19:10:33
%S A113744 1,8,22,42,70,102,142,192,240,298,360,438,510,612,708,780,898,1002,
%T A113744 1122,1254,1392,1542,1662,1834,1992,2118,2302,2494,2662,2862,3054,
%U A113744 3274,3502,3648,3930,4114,4374,4582,4834,5122,5382,5628,5938,6162,6462,6834,7092
%N A113744 Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 7 multiples of n-1, n-2, ..., 1, for n>=1.
%H A113744 <a href="/index/J#Josephus">Index entries for sequences related to the Josephus Problem</a>
%t A113744 f[n_] := Fold[ #2*Ceiling[ #1/#2 + 6] &, n, Reverse@Range[n - 1]]; Array[f, 47]
%Y A113744 Cf. {k=-1..12} A000012, A002491, A000960 (Flavius Josephus's sieve), A112557, A112558, A113742, A113743, A113744, A113745, A113746, A113747, A113748; det. A113749.
%K A113744 nonn
%O A113744 1,2
%A A113744 _Paul D. Hanna_ and _Robert G. Wilson v_, Nov 05 2005