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.

A257969 Numbers m such that the sum of the digits (sod) of m, m^2, m^3, ..., m^9 are in arithmetic progression: sod(m^(k+1)) - sod(m^k) = f for k=1..8.

Table of values

n a(n)
1 1
2 10
3 100
4 1000
5 7972
6 10000
7 53941
8 79720
9 100000
10 134242
11 539410
12 698614
13 797200
14 1000000
15 1342420
16 5394100
17 6986140
18 7525615
19 7972000
20 9000864
21 10000000
22 10057054
23 13424200
24 15366307
25 17513566
26 20602674
27 23280211
28 24716905
29 25274655
30 25665559
31 32083981
32 34326702
33 34446204
34 34534816

List of values

[1, 10, 100, 1000, 7972, 10000, 53941, 79720, 100000, 134242, 539410, 698614, 797200, 1000000, 1342420, 5394100, 6986140, 7525615, 7972000, 9000864, 10000000, 10057054, 13424200, 15366307, 17513566, 20602674, 23280211, 24716905, 25274655, 25665559, 32083981, 34326702, 34446204, 34534816]