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.

A020951 a(2n+1)=a(n), a(2n)=a(n)+a(n-1).

This page as a plain text file.
%I A020951 #11 Jul 20 2013 16:27:22
%S A020951 1,0,1,0,1,1,1,0,1,1,2,1,2,1,1,0,1,1,2,1,3,2,3,1,3,2,3,1,2,1,1,0,1,1,
%T A020951 2,1,3,2,3,1,4,3,5,2,5,3,4,1,4,3,5,2,5,3,4,1,3,2,3,1,2,1,1,0,1,1,2,1,
%U A020951 3,2,3,1,4,3,5,2,5,3,4,1,5
%N A020951 a(2n+1)=a(n), a(2n)=a(n)+a(n-1).
%H A020951 Reinhard Zumkeller, <a href="/A020951/b020951.txt">Table of n, a(n) for n = 0..10000</a>
%o A020951 (Haskell)
%o A020951 a020951 n = a020951_list !! n
%o A020951 a020951_list = 1 : ws where
%o A020951    ws = 0 : 1 : concat (zipWith (\u v -> [u, u + v]) ws $ tail ws)
%o A020951 -- _Reinhard Zumkeller_, Jul 19 2013, Mar 13 2013
%Y A020951 Cf. A082498.
%K A020951 nonn
%O A020951 0,11
%A A020951 _Clark Kimberling_