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.

A075148 Table E(n,k) (listed antidiagonalwise as E(0,0), E(1,0), E(0,1), E(2,0), E(1,1), E(0,2), ...) where E(n,k) is F(n+k) for all even n and L(n+k) for all odd n. F(n) and L(n) are the n-th Fibonacci (A000045) and Lucas (A000032) numbers respectively.

This page as a plain text file.
%I A075148 #5 May 01 2014 02:48:30
%S A075148 0,1,1,1,3,1,4,2,4,2,3,7,3,7,3,11,5,11,5,11,5,8,18,8,18,8,18,8,29,13,
%T A075148 29,13,29,13,29,13,21,47,21,47,21,47,21,47,21,76,34,76,34,76,34,76,34,
%U A075148 76,34,55,123,55,123,55,123,55,123,55,123,55,199,89,199,89,199,89,199
%N A075148 Table E(n,k) (listed antidiagonalwise as E(0,0), E(1,0), E(0,1), E(2,0), E(1,1), E(0,2), ...) where E(n,k) is F(n+k) for all even n and L(n+k) for all odd n. F(n) and L(n) are the n-th Fibonacci (A000045) and Lucas (A000032) numbers respectively.
%F A075148 E(n, k) = (fibonacci(n+k-(n mod 2))+fibonacci(n+k+(n mod 2)))/(2-(n mod 2))
%p A075148 with(combinat); [seq(A075148(A025581(n), A002262(n)),n=0..119)]; A075148 := (n,k) -> (fibonacci(n+k-(n mod 2))+fibonacci(n+k+(n mod 2)))/(2-(n mod 2));
%Y A075148 Used to construct A050609 & A048757. Cf. A025581, A002262.
%K A075148 nonn,tabl
%O A075148 0,5
%A A075148 _Antti Karttunen_, Sep 05 2002