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.

A339541 a(n) = n + sod(n, sod(n, 10)), where sod(n,b) is the sum of base-b digits of n.

This page as a plain text file.
%I A339541 #7 Dec 08 2020 21:15:31
%S A339541 2,3,4,5,6,7,8,9,10,20,14,14,17,20,20,20,20,20,29,22,24,26,30,28,32,
%T A339541 31,30,38,38,32,38,36,41,44,42,40,47,46,45,44,46,44,50,53,50,56,54,52,
%U A339541 62,52,57,56,64,60,65,62,70,68,66,65,68,75,70,74,80,77,74,84,82,74,79,80,83,88,84,92
%N A339541 a(n) = n + sod(n, sod(n, 10)), where sod(n,b) is the sum of base-b digits of n.
%H A339541 Robert Israel, <a href="/A339541/b339541.txt">Table of n, a(n) for n = 1..10000</a>
%F A339541 a(n) = n + A138530(n, A007953(n)).
%e A339541 a(15) = 15 + 5 = 20 because sod(15,10) = 6 and sod(15,6) = 5 (because 15 = 23_6).
%p A339541 sod:= proc(x,b) if b=1 then x else convert(convert(x,base,b),`+`) fi end proc:
%p A339541 f:= x -> x + sod(x,sod(x,10)):
%p A339541 map(f, [$1..100]);
%Y A339541 Cf. A007953, A138530
%K A339541 nonn,base
%O A339541 1,1
%A A339541 _Robert Israel_, Dec 08 2020