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!)
A026380 a(n) = T(n,[ n/2 ]), where T is the array in A026374. 2

%I #12 Nov 27 2018 09:29:58

%S 1,3,4,11,17,45,75,195,339,873,1558,3989,7247,18483,34016,86515,

%T 160795,408105,764388,1936881,3650571,9238023,17501619,44241261,

%U 84179877,212601015,406020930,1024642875,1963073865,4950790605

%N a(n) = T(n,[ n/2 ]), where T is the array in A026374.

%H D. E. Davenport, L. W. Shapiro and L. C. Woodson, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i2p33">The Double Riordan Group</a>, The Electronic Journal of Combinatorics, 18(2) (2012), #P33. - From _N. J. A. Sloane_, May 11 2012

%F a(2n)=A026378(n+1), a(2n-1)=A026375(n). - _Emeric Deutsch_, Feb 18 2004

%F a(2n) = A026378(2n+1), a(2n+1) = A026375(n+1).

%F Davenport et al. give a g.f.

%Y Cf. A026375, A026378.

%K nonn

%O 0,2

%A _Clark Kimberling_

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 March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)