cp's OEIS Frontend

A339713 a(n) = (a(n-2) concatenate a(n-1)) for n > 2, with a(1)=1, a(2)=10.

%I A339713 #18 Apr 26 2021 13:54:49
%S A339713 1,10,110,10110,11010110,1011011010110,110101101011011010110,
%T A339713 1011011010110110101101011011010110,
%U A339713 1101011010110110101101011011010110110101101011011010110,10110110101101101011010110110101101101011010110110101101011011010110110101101011011010110
%N A339713 a(n) = (a(n-2) concatenate a(n-1)) for n > 2, with a(1)=1, a(2)=10.
%C A339713 Number of digits in a(n) = A000045(n+1). - _Michael S. Branicky_, Apr 24 2021
%C A339713 a(n) and a(n+1) contain Fibonacci(n) 1's and Fibonacci(n) 0's respectively.
%o A339713 (Python)
%o A339713 def aupton(terms):
%o A339713   alst = [1, 10]
%o A339713   for n in range(3, terms+1): alst.append(int(str(alst[-2])+str(alst[-1])))
%o A339713   return alst[:terms]
%o A339713 print(aupton(10)) # _Michael S. Branicky_, Apr 24 2021
%Y A339713 Cf. A000045, A111061 (in decimal), A061107, A131293.
%K A339713 nonn,base
%O A339713 1,2
%A A339713 _Wesley Ivan Hurt_, Apr 24 2021