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.

A272029 Least number k > n such that the multiplicative and additive digital roots of k are both equal to n.

This page as a plain text file.
%I A272029 #40 Jul 24 2016 09:45:49
%S A272029 1111111111,137,1111111113,22,1157,123,1111111117,179,11133
%N A272029 Least number k > n such that the multiplicative and additive digital roots of k are both equal to n.
%C A272029 Sequence is trivially finite by definition.
%C A272029 How is the distribution of corresponding digital roots in A064702? This sequence is the result of related observation in limited range.
%e A272029 a(5) = 1157 because 1+1+5+7 = 14, 1+4 = 5 and 1*1*5*7 = 35, 3*5 = 15, 1*5 = 5. 1157 is the least number that is greater than 5 with this property.
%Y A272029 Cf. A010888, A031347, A064702.
%K A272029 nonn,easy,base,fini,full
%O A272029 1,1
%A A272029 _Altug Alkan_, Jul 13 2016