cp's OEIS Frontend

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.

A014822 Numbers k such that k divides s(k), where s(1)=1, s(j)=10*s(j-1)+j (A014824).

This page as a plain text file.
%I A014822 #13 Feb 28 2025 12:06:27
%S A014822 1,2,3,5,6,9,10,15,18,22,27,30,42,45,54,66,78,81,90,110,111,126,135,
%T A014822 162,198,205,210,222,234,242,243,270,294,330,333,342,378,390,405,410,
%U A014822 462,465,486,506,546,555,594,615,630,666,702,726,729,810,858,882,930
%N A014822 Numbers k such that k divides s(k), where s(1)=1, s(j)=10*s(j-1)+j (A014824).
%H A014822 Robert Israel, <a href="/A014822/b014822.txt">Table of n, a(n) for n = 1..1000</a>
%p A014822 s:= proc(n) option remember; 10*procname(n-1)+n end proc: s(1):= 1:
%p A014822 select(t -> s(t) mod t = 0, [$1..10000]); # _Robert Israel_, Feb 28 2025
%t A014822 Transpose[Select[NestList[{#[[1]]+1,10#[[2]]+#[[1]]+1}&,{1,1},1000],Divisible[ #[[2]],#[[1]]]&]][[1]] (* _Harvey P. Dale_, Sep 24 2012 *)
%K A014822 nonn
%O A014822 1,2
%A A014822 _N. J. A. Sloane_