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 A215975 #7 Aug 29 2012 16:54:31
%S A215975 1,1,1,1,1,1,2,1,1,1,2,1,1,2,1,2,1,2,1,5,2,1,9,5,3,6,9,2,2,2,9,9,9,
%T A215975 22680,31,2,34,3335,31,9,10,881,9450,9450,7875,3637,3637,34,130,
%U A215975 199394,10364,25784652043917,73,28372148,3000,348729431334264344425340064330765473421034034140890,21279111,6774778,31,3157469,595,182493908282594631,1400,13928971534455392
%N A215975 The integers floor((1.1)^k(n))/floor((1.1)^n) arising in A069751, where k(n) = A069751(n).
%C A215975 Created to provide a check on the calculations in A096151.
%t A215975 kln2[n_] := Module[{k = n + 1, den = Floor[ (11/10)^n]}, While[ ! IntegerQ[Floor[(11/10)^k]/den], k++]; Floor[(11/10)^k]/den]; Array[kln2,70] (* _Harvey P. Dale_, Aug 29 2012 *)
%Y A215975 Cf. A069751.
%K A215975 nonn
%O A215975 1,7
%A A215975 _N. J. A. Sloane_, Aug 29 2012