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.

A263534 Consider the 10's complements mod 10 of the digits of a number k. Take their sum and repeat the process deleting the first addend and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to k.

Table of values

n a(n)
1 29
2 76
3 157
4 174
5 191
6 475
7 713
8 1129
9 1961
10 3286
11 4424
12 7812
13 8973
14 19978
15 24317
16 35845
17 37041
18 51712
19 68022
20 166838
21 443275
22 444247
23 445219
24 509439
25 706317
26 1189312
27 1933197
28 2686010
29 10809303
30 55558901
31 58338037
32 257990335
33 504050156
34 839186880

List of values

[29, 76, 157, 174, 191, 475, 713, 1129, 1961, 3286, 4424, 7812, 8973, 19978, 24317, 35845, 37041, 51712, 68022, 166838, 443275, 444247, 445219, 509439, 706317, 1189312, 1933197, 2686010, 10809303, 55558901, 58338037, 257990335, 504050156, 839186880]