A237568 - cp's OEIS frontend

A237568 Fibonacci-like sequence of numbers with nondecreasing positive digits. Let a^+ denote the number that is obtained from a if its positive digits are written in nondecreasing order, while zeros remain in their places. Let a<+>b = (a + b)^+. a(0)=0, a(1)=1, for n>=2, a(n) = a(n-1) <+> a(n-2).

n	a(n)
0	0
1	1
2	1
3	2
4	3
5	5
6	8
7	13
8	12
9	25
10	37
11	26
12	36
13	26
14	26
15	25
16	15
17	40
18	55
19	59
20	114
21	137
22	125
23	226
24	135
25	136
26	127
27	236
28	336
29	257
30	359
31	166
32	255
33	124
34	379
35	305
36	468
37	377
38	458
39	358
40	168
41	256
42	244
43	500
44	447
45	479
46	269
47	478
48	477
49	559
50	1036
51	1559
52	2559
53	1148
54	3707
55	4558
56	2568
57	1267
58	3358
59	2456
60	1458
61	1349
62	2708
63	4057
64	5667
65	2479
66	1468
67	3479
68	4479
69	5789
70	10268
71	15067
72	23355
73	22348

[0, 1, 1, 2, 3, 5, 8, 13, 12, 25, 37, 26, 36, 26, 26, 25, 15, 40, 55, 59, 114, 137, 125, 226, 135, 136, 127, 236, 336, 257, 359, 166, 255, 124, 379, 305, 468, 377, 458, 358, 168, 256, 244, 500, 447, 479, 269, 478, 477, 559, 1036, 1559, 2559, 1148, 3707, 4558, 2568, 1267, 3358, 2456, 1458, 1349, 2708, 4057, 5667, 2479, 1468, 3479, 4479, 5789, 10268, 15067, 23355, 22348]

cp's OEIS Frontend

A237568 Fibonacci-like sequence of numbers with nondecreasing positive digits. Let a^+ denote the number that is obtained from a if its positive digits are written in nondecreasing order, while zeros remain in their places. Let a<+>b = (a + b)^+. a(0)=0, a(1)=1, for n>=2, a(n) = a(n-1) <+> a(n-2).

Table of values

List of values