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.

A377416 Least integer k which, by a process analogous to the Keith numbers, reach k + n.

Original entry on oeis.org

14, 12, 11, 10, 16, 13, 17, 37, 18, 12, 11, 10, 40, 15, 27, 39, 13, 16, 24, 67, 22, 17, 12, 11, 10, 18, 21, 36, 43, 19, 15, 58, 23, 30, 13, 51, 48, 16, 54, 27, 44, 38, 34, 12, 11, 10, 14, 91, 20, 32, 55, 18, 42, 29, 35, 21, 25, 277, 15, 150, 66, 72, 56, 13, 46
Offset: 0

Views

Author

Paolo P. Lava, Oct 27 2024

Keywords

Examples

			a(5) = 13 because 1 + 3 = 4, 3 + 4 = 7, 4 + 7 = 11, 7 + 11 = 18 that is 13 + 5.
		

Crossrefs

Programs

  • Maple
    with(numtheory): P:=proc(q,h) local a,b,c,j,k,n,t,v; v:=array(1..h); c:=[];
    for j from 0 to 59 do for n from 10 to q do a:=n; b:=length(a);
    for k from 1 to b do v[b-k+1]:=(a mod 10); a:=trunc(a/10); od; t:=b+1; v[t]:=add(v[k],k=1..b);
    while v[t]