A237575 - cp's OEIS frontend

A237575 Fibonacci-like numbers with nonincreasing positive digits. Let a denote the number that is obtained from a if its digits are written in nonincreasing order. 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	31
8	93
9	421
10	541
11	962
12	5310
13	7622
14	93221
15	843100
16	963321
17	8642110
18	9654310
19	98642210
20	986522100
21	8654311100
22	9864332000
23	88654311100
24	98865431100
25	987754221100
26	9866652211000
27	86544432110000
28	98644321110000
29	888755322110000

[0, 1, 1, 2, 3, 5, 8, 31, 93, 421, 541, 962, 5310, 7622, 93221, 843100, 963321, 8642110, 9654310, 98642210, 986522100, 8654311100, 9864332000, 88654311100, 98865431100, 987754221100, 9866652211000, 86544432110000, 98644321110000, 888755322110000]

cp's OEIS Frontend

A237575 Fibonacci-like numbers with nonincreasing positive digits. Let a denote the number that is obtained from a if its digits are written in nonincreasing order. 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

cp's OEIS Frontend

A237575 Fibonacci-like numbers with nonincreasing positive digits. Let a** denote the number that is obtained from a if its digits are written in nonincreasing order. 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

A237575 Fibonacci-like numbers with nonincreasing positive digits. Let a denote the number that is obtained from a if its digits are written in nonincreasing order. Let a<+>b = (a + b). a(0)=0, a(1)=1, for n>=2, a(n) = a(n-1) <+> a(n-2).