login
a(n) = prime(Fibonacci(n)) written in base 2.
0

%I #6 Sep 08 2022 08:46:18

%S 10,10,11,101,1011,10011,101001,1001001,10001011,100000001,111001101,

%T 1100111011,10110111111,101000011111,1000110001101,1111001110001,

%U 11010010011101,101101001110111,1001101101100011,10000100101011011,11100010001110111,110000000001001111

%N a(n) = prime(Fibonacci(n)) written in base 2.

%t Table[FromDigits[IntegerDigits[Prime[Fibonacci[n]], 2]], {n, 1, 30}]

%o (Magma) [Seqint(Intseq(NthPrime(Fibonacci(n)), 2)): n in [1..25]];

%Y Cf. A000040, A000045, A004685, A005478, A030427.

%K nonn

%O 1,1

%A _Vincenzo Librandi_, Dec 27 2016