login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214322 a(n) = A214551(n-1) + A214551(n-3), with a(0) = a(1) = a(2) = 1. 3

%I

%S 1,1,1,2,3,4,6,6,6,6,4,5,7,9,14,21,12,18,12,8,11,15,17,28,43,60,88,65,

%T 125,47,112,137,184,296,174,358,216,390,244,460,180,280,185,73,143,

%U 180,253,396,216,259,295,301,560,375,376,456,132,420,162,98,154,76,87,109,147,234,187,334,412,393,727,933,1326,1169,2102,2544,2441,4543,5815,8256,12799

%N a(n) = A214551(n-1) + A214551(n-3), with a(0) = a(1) = a(2) = 1.

%C A214551(n) = A214322(n)/A214323(n).

%H Reinhard Zumkeller, <a href="/A214322/b214322.txt">Table of n, a(n) for n = 0..10000</a>

%o (Haskell)

%o a214322 n = a214322_list !! n

%o a214322_list = 1 : 1 : 1 : zipWith (+) a214551_list (drop 2 a214551_list)

%o -- _Reinhard Zumkeller_, Jul 24 2012

%Y Cf. A214551, A214323.

%K nonn

%O 0,4

%A _N. J. A. Sloane_, Jul 23 2012

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 14:42 EDT 2021. Contains 348214 sequences. (Running on oeis4.)