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!)
A214127 a(2n) = a(n-1) + a(n) and a(2n+1) = a(n+1) for n>=1, with a(0)=1, a(1)=2. 1

%I #10 May 21 2021 16:22:17

%S 1,2,3,3,5,3,6,5,8,3,8,6,9,5,11,8,13,3,11,8,11,6,14,9,15,5,14,11,16,8,

%T 19,13,21,3,16,11,14,8,19,11,19,6,17,14,20,9,23,15,24,5,20,14,19,11,

%U 25,16,27,8,24,19,27,13,32,21,34,3,24,16,19,11,27,14,25

%N a(2n) = a(n-1) + a(n) and a(2n+1) = a(n+1) for n>=1, with a(0)=1, a(1)=2.

%t t = {1, 2}; Do[If[EvenQ[n], AppendTo[t, t[[n/2]] + t[[n/2 + 1]]], AppendTo[t, t[[(n + 3)/2]]]], {n, 2, 100}]; t (* _T. D. Noe_, Jul 11 2012 *)

%o (Python)

%o a = [1]*(77*2)

%o a[1]=2

%o for n in range(1,77):

%o a[2*n ]=a[n-1]+a[n]

%o a[2*n+1]=a[n+1]

%o print(str(a[n-1]),end=',')

%Y Cf. A120562: same formula, seed {0,1}, first term removed.

%Y Cf. A082498: same formula, seed {1,0}, first term removed.

%Y Cf. A214126: same formula, seed {1,1}.

%K nonn,easy

%O 0,2

%A _Alex Ratushnyak_, Jul 04 2012

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 September 4 02:28 EDT 2024. Contains 375679 sequences. (Running on oeis4.)