A282839 Numbers that are equal to the sum of descending numbers raised to their digits' powers.

1, 65, 6796

Offset

1,2

Comments

Sequence is complete.

Links

Table of n, a(n) for n=1..3.

Example

1 = 1^1;
65 = 2^6 + 1^5;
6796 = 4^6 + 3^7 + 2^9 + 1^6.

Mathematica

Select[Range[10^5], # == Total[ Reverse[ Range@ IntegerLength@ #]^ IntegerDigits@ #] &] (* Giovanni Resta, Feb 23 2017 *)

Prog

(VBA)
sub calcul()
sheets("Result").select
range("A1").select
for i=1 to 10^13
sum=0
for k=1 to len(i)
sum=sum+(len(i)-k+1)^mid(i, k, 1)
next
if i=sum then
activecell.value=i
activesheet.offset(1, 0).select
end if
next
end sub
(PARI) isok(n) = my(d=digits(n)); sum(k=1, #d, (#d-k+1)^d[k]) == n; \\ Michel Marcus, Feb 24 2017

Crossrefs

Cf. A035138, A032799.

Sequence in context: A116104 A116121 A118707 * A144661 A296144 A373761

Adjacent sequences: A282836 A282837 A282838 * A282840 A282841 A282842

Keyword

nonn,base,bref,fini,full

Author

Shmelev Aleksei, Feb 22 2017

Status

approved