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.

A237415 For k in {2,3,...,9} define a sequence as follows: a(0)=0; for n>=0, a(n+1)=a(n)+1, unless a(n) ends in k, in which case a(n+1) is obtained by replacing the last digit of a(n) with the digit(s) of k^3. This is k(2).

Table of values

n a(n)
0 0
1 1
2 2
3 8
4 9
5 10
6 11
7 12
8 18
9 19
10 20
11 21
12 22
13 28
14 29
15 30
16 31
17 32
18 38
19 39
20 40
21 41
22 42
23 48
24 49
25 50
26 51
27 52
28 58
29 59
30 60
31 61
32 62
33 68
34 69
35 70
36 71
37 72
38 78
39 79
40 80
41 81
42 82
43 88
44 89
45 90
46 91
47 92
48 98
49 99
50 100
51 101
52 102
53 108
54 109
55 110
56 111
57 112
58 118
59 119
60 120
61 121
62 122
63 128

List of values

[0, 1, 2, 8, 9, 10, 11, 12, 18, 19, 20, 21, 22, 28, 29, 30, 31, 32, 38, 39, 40, 41, 42, 48, 49, 50, 51, 52, 58, 59, 60, 61, 62, 68, 69, 70, 71, 72, 78, 79, 80, 81, 82, 88, 89, 90, 91, 92, 98, 99, 100, 101, 102, 108, 109, 110, 111, 112, 118, 119, 120, 121, 122, 128]