A336661 - cp's OEIS frontend

A336661 Numbers that have decimal expansion c(1)c(2)...c(n) with distinct digits that satisfy c(1) <> 0, c(1) is the largest digit, and for each i in 1..n there is j in 0..2 such that c(i) == 3*c(i-1) + j (mod 10) (with c(0): = c(n)).

n	a(n)
1	0
2	4
3	5
4	9
5	31
6	72
7	86
8	301
9	431
10	602
11	715
12	842
13	856
14	973
15	986
16	4301
17	6015
18	7142
19	7302
20	7315
21	8426
22	8572
23	8602
24	9713
25	9726
26	9843
27	9856
28	60142
29	71302
30	73015
31	73142
32	84302
33	85602
34	85726
35	97143
36	97156
37	97286
38	98426
39	98573
40	714302
41	715602
42	726015
43	730142
44	843026
45	843156
46	857142
47	857302
48	860142
49	971426
50	972843
51	972856
52	973026
53	973156
54	984273
55	985713
56	985726
57	986013

[0, 4, 5, 9, 31, 72, 86, 301, 431, 602, 715, 842, 856, 973, 986, 4301, 6015, 7142, 7302, 7315, 8426, 8572, 8602, 9713, 9726, 9843, 9856, 60142, 71302, 73015, 73142, 84302, 85602, 85726, 97143, 97156, 97286, 98426, 98573, 714302, 715602, 726015, 730142, 843026, 843156, 857142, 857302, 860142, 971426, 972843, 972856, 973026, 973156, 984273, 985713, 985726, 986013]

cp's OEIS Frontend

A336661 Numbers that have decimal expansion c(1)c(2)...c(n) with distinct digits that satisfy c(1) <> 0, c(1) is the largest digit, and for each i in 1..n there is j in 0..2 such that c(i) == 3*c(i-1) + j (mod 10) (with c(0): = c(n)).

Table of values

List of values