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.

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

Original entry on oeis.org

1, 65, 6796
Offset: 1

Views

Author

Shmelev Aleksei, Feb 22 2017

Keywords

Comments

Sequence is complete.

Examples

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

Crossrefs

Programs

  • Mathematica
    Select[Range[10^5], # == Total[ Reverse[ Range@ IntegerLength@ #]^ IntegerDigits@ #] &] (* Giovanni Resta, Feb 23 2017 *)
  • PARI
    isok(n) = my(d=digits(n)); sum(k=1, #d, (#d-k+1)^d[k]) == n; \\ Michel Marcus, Feb 24 2017
  • 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