login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A339713 a(n) = (a(n-2) concatenate a(n-1)) for n > 2, with a(1)=1, a(2)=10. 0
1, 10, 110, 10110, 11010110, 1011011010110, 110101101011011010110, 1011011010110110101101011011010110, 1101011010110110101101011011010110110101101011011010110, 10110110101101101011010110110101101101011010110110101101011011010110110101101011011010110 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Number of digits in a(n) = A000045(n+1). - Michael S. Branicky, Apr 24 2021

a(n) and a(n+1) contain Fibonacci(n) 1's and Fibonacci(n) 0's respectively.

LINKS

Table of n, a(n) for n=1..10.

PROG

(Python)

def aupton(terms):

  alst = [1, 10]

  for n in range(3, terms+1): alst.append(int(str(alst[-2])+str(alst[-1])))

  return alst[:terms]

print(aupton(10)) # Michael S. Branicky, Apr 24 2021

CROSSREFS

Cf. A000045, A111061 (in decimal), A061107, A131293.

Sequence in context: A297500 A305213 A181929 * A020767 A036603 A092500

Adjacent sequences:  A339710 A339711 A339712 * A339714 A339715 A339716

KEYWORD

nonn,base

AUTHOR

Wesley Ivan Hurt, Apr 24 2021

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 17 10:27 EDT 2022. Contains 356187 sequences. (Running on oeis4.)