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.

A055015 Sum of 6th powers of digits of n.

This page as a plain text file.
%I A055015 #19 Sep 08 2022 08:45:01
%S A055015 0,1,64,729,4096,15625,46656,117649,262144,531441,1,2,65,730,4097,
%T A055015 15626,46657,117650,262145,531442,64,65,128,793,4160,15689,46720,
%U A055015 117713,262208,531505,729,730,793,1458,4825,16354,47385,118378,262873
%N A055015 Sum of 6th powers of digits of n.
%C A055015 The only fixed points (n = 0, 1 and 548834) are listed in row 6 of A252648. - _M. F. Hasler_, Apr 12 2015
%H A055015 Michel Marcus, <a href="/A055015/b055015.txt">Table of n, a(n) for n = 0..999</a>
%H A055015 <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a>
%F A055015 a(n) = Sum_{k>0} (floor(n/10^k) - 10*floor(n/10^(k+1)))^6. - _Hieronymus Fischer_, Jun 25 2007
%F A055015 a(10n+k) = a(n) + k^6, 0 <= k < 10. - _Hieronymus Fischer_, Jun 25 2007
%p A055015 for n from 0 to 3 do seq(n^6+j^6, j=0..9 ); od; # _Zerinvary Lajos_, Nov 06 2006
%t A055015 Table[Sum[DigitCount[n][[i]] i^6, {i, 9}], {n, 0, 40}] (* _Bruno Berselli_, Feb 01 2013 *)
%o A055015 (Magma) [0] cat [&+[d^6: d in Intseq(n)]: n in [1..40]]; // _Bruno Berselli_, Feb 01 2013
%o A055015 (PARI) A055015(n)=sum(i=1,#n=digits(n),n[i]^6) \\ _M. F. Hasler_, Apr 12 2015
%Y A055015 Cf. A003132.
%Y A055015 Cf. A003132, A055012, A055013, A005514.
%Y A055015 Cf. A007953, A055017, A076313, A076314.
%K A055015 base,nonn
%O A055015 0,3
%A A055015 _Henry Bottomley_, May 31 2000