A326652 a(n) is the sum of each distinct digit in n, raised to the power of its number of appearances in n.

1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 1, 3, 4, 5, 6, 7, 8, 9, 10, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 3, 4, 5, 9, 7, 8, 9, 10, 11, 12, 4, 5, 6, 7, 16, 9, 10, 11, 12, 13, 5, 6, 7, 8, 9, 25, 11, 12, 13, 14, 6, 7, 8, 9, 10, 11, 36, 13, 14, 15, 7, 8, 9, 10, 11, 12, 13, 49, 15, 16

Offset

1,2

Links

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

Example

a(5) = 5^1 = 5;
a(11) = 1^2 = 1;
a(12) = (1^1)+(2^1) = 1+2 = 3.

Maple

a:= n-> (l-> add(i^numboccur(i, l), i={l[]}))(convert(n, base, 10)):
seq(a(n), n=1..100);  # Alois P. Heinz, Sep 17 2019

Mathematica

a[n_] := Plus @@ Power @@@ Tally[IntegerDigits[n]]; Array[a, 100] (* Amiram Eldar, Sep 17 2019 *)

Prog

(PARI) a(n) = {my(d = digits(n), sd = Set(d)); sum(k=1, #sd, sd[k]^#select(x->(x==sd[k]), d)); } \\ Michel Marcus, Sep 17 2019

Crossrefs

Sequence in context: A066750 A371383 A217928 * A222493 A032762 A371535

Adjacent sequences: A326649 A326650 A326651 * A326653 A326654 A326655

Keyword

nonn,base,easy

Author

David Robillard, Sep 12 2019

Status

approved