A305379 Tribonacci representation of primes, written in base 2.
10, 11, 101, 1000, 1100, 10000, 10100, 10110, 11011, 100101, 101000, 110000, 110100, 110110, 1000011, 1001010, 1010010, 1010100, 1011011, 1100011, 1100101, 1101100, 10000010, 10001001, 10010011, 10011000, 10011010, 10100010, 10100100, 10101001, 11000010
Offset: 1
Links
- Alois P. Heinz, Table of n, a(n) for n = 1..20000
Programs
-
Maple
T:= proc(n) T(n):= (<<0|1|0>, <0|0|1>, <1|1|1>>^n)[2, 3] end: b:= proc(n) option remember; local j; if n=0 then 0 else for j from 2 while T(j+1)<=n do od; b(n-T(j))+10^(j-2) fi end: a:= n-> b(ithprime(n)): seq(a(n), n=1..40); # Alois P. Heinz, Jun 13 2018
Extensions
More terms from Alois P. Heinz, Jun 13 2018