A305753 - cp's OEIS frontend

A305753 A base-3/2 sorted Fibonacci sequence that starts with a(0) = 0 and a(1) = 1. The terms are interpreted as numbers written in base 3/2. To get a(n+2), add a(n) and a(n+1), write the result in base 3/2 and sort the "digits" into increasing order, omitting all zeros.

n	a(n)
0	0
1	1
2	1
3	2
4	2
5	12
6	12
7	112
8	112
9	1112
10	1112
11	11112
12	11112
13	111112
14	111112
15	1111112
16	1111112
17	11111112
18	11111112
19	111111112
20	111111112
21	1111111112
22	1111111112
23	11111111112
24	11111111112
25	111111111112
26	111111111112
27	1111111111112
28	1111111111112
29	11111111111112
30	11111111111112

[0, 1, 1, 2, 2, 12, 12, 112, 112, 1112, 1112, 11112, 11112, 111112, 111112, 1111112, 1111112, 11111112, 11111112, 111111112, 111111112, 1111111112, 1111111112, 11111111112, 11111111112, 111111111112, 111111111112, 1111111111112, 1111111111112, 11111111111112, 11111111111112]

cp's OEIS Frontend

A305753 A base-3/2 sorted Fibonacci sequence that starts with a(0) = 0 and a(1) = 1. The terms are interpreted as numbers written in base 3/2. To get a(n+2), add a(n) and a(n+1), write the result in base 3/2 and sort the "digits" into increasing order, omitting all zeros.

Table of values

List of values