cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A214127 #10 May 21 2021 16:22:17
%S A214127 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 A214127 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 A214127 25,16,27,8,24,19,27,13,32,21,34,3,24,16,19,11,27,14,25
%N 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.
%t A214127 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 A214127 (Python)
%o A214127 a = [1]*(77*2)
%o A214127 a[1]=2
%o A214127 for n in range(1,77):
%o A214127     a[2*n  ]=a[n-1]+a[n]
%o A214127     a[2*n+1]=a[n+1]
%o A214127     print(str(a[n-1]),end=',')
%Y A214127 Cf. A120562: same formula, seed {0,1}, first term removed.
%Y A214127 Cf. A082498: same formula, seed {1,0}, first term removed.
%Y A214127 Cf. A214126: same formula, seed {1,1}.
%K A214127 nonn,easy
%O A214127 0,2
%A A214127 _Alex Ratushnyak_, Jul 04 2012