Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062161
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062161 Boustrophedon transform of n mod 2. +0
5
0, 1, 2, 4, 12, 36, 142, 624, 3192, 18256, 116282, 814144, 6219972, 51475776, 458790022, 4381112064, 44625674352, 482962852096, 5534347077362, 66942218896384, 852334810990332, 11394877025289216 (list; graph; listen)
OFFSET

0,3

LINKS

Index entries for sequences related to boustrophedon transform

FORMULA

E.g.f.: (sec(x)+tan(x))sinh(x); a(n)=(A000667(n)-A062162(n))/2. - Paul Barry (pbarry(AT)wit.ie), Jan 21 2005

a(n) = Sum{k, k>=0} binomial(n, 2k+1)*A000111(n-2k-1) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Aug 28 2005

CROSSREFS

a(2n) = A009747(n), a(2n+1) = A002084(n), cf. A062272.

Sequence in context: A009152 A081443 A086647 this_sequence A046993 A010551 A111942

Adjacent sequences: A062158 A062159 A062160 this_sequence A062162 A062163 A062164

KEYWORD

nonn,easy

AUTHOR

Frank.Ellermann(AT)t-online.de, Jun 10 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research