A352103 - cp's OEIS frontend

A352103 a(n) is the maximal (or lazy) tribonacci representation of n using a binary system of vectors not containing three consecutive 0's.

n	a(n)
0	0
1	1
2	10
3	11
4	100
5	101
6	110
7	111
8	1001
9	1010
10	1011
11	1100
12	1101
13	1110
14	1111
15	10010
16	10011
17	10100
18	10101
19	10110
20	10111
21	11001
22	11010
23	11011
24	11100
25	11101
26	11110
27	11111
28	100100
29	100101
30	100110
31	100111
32	101001
33	101010
34	101011
35	101100
36	101101
37	101110
38	101111
39	110010

[0, 1, 10, 11, 100, 101, 110, 111, 1001, 1010, 1011, 1100, 1101, 1110, 1111, 10010, 10011, 10100, 10101, 10110, 10111, 11001, 11010, 11011, 11100, 11101, 11110, 11111, 100100, 100101, 100110, 100111, 101001, 101010, 101011, 101100, 101101, 101110, 101111, 110010]

cp's OEIS Frontend

A352103 a(n) is the maximal (or lazy) tribonacci representation of n using a binary system of vectors not containing three consecutive 0's.

Table of values

List of values