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.

A051373 a(n+1) = a(n) + sum of digits of (a(n)^3).

This page as a plain text file.
%I A051373 #10 Jul 02 2025 16:01:58
%S A051373 1,2,10,11,19,47,64,83,118,137,163,191,235,281,307,344,379,425,469,
%T A051373 497,532,578,604,641,676,722,766,812,856,884,919,965,1009,1046,1081,
%U A051373 1109,1153,1199,1252,1289,1324,1352,1387,1433,1486,1532,1585,1640,1666,1712
%N A051373 a(n+1) = a(n) + sum of digits of (a(n)^3).
%H A051373 Harvey P. Dale, <a href="/A051373/b051373.txt">Table of n, a(n) for n = 1..1000</a>
%t A051373 NestList[#+Total[IntegerDigits[#^3]]&,1,50] (* _Harvey P. Dale_, Dec 25 2015 *)
%o A051373 (PARI) sod(n) = d = digits(n); sum(i=1, #d, d[i])
%o A051373 lista(nn) = {na = 1; for (i=1, nn, print1(na, ", "); na += sod(na^3););} \\ _Michel Marcus_, Jun 22 2013
%Y A051373 Cf. A033298.
%K A051373 easy,nonn,base
%O A051373 1,2
%A A051373 Miklos SZABO (mike(AT)ludens.elte.hu)
%E A051373 More terms from _James Sellers_, May 01 2000