Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062272
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062272 Boustrophedon transform of (n+1) mod 2. +0
7
1, 1, 2, 5, 12, 41, 152, 685, 3472, 19921, 126752, 887765, 6781632, 56126201, 500231552, 4776869245, 48656756992, 526589630881, 6034272215552, 72989204937125, 929327412759552, 12424192360405961, 174008703107274752 (list; graph; listen)
OFFSET

0,3

LINKS

Index entries for sequences related to boustrophedon transform

FORMULA

E.g.f.: (sec(x)+tan(x))cosh(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)*A000111(n-2k) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Aug 28 2005

CROSSREFS

A000734 (binomial transform), a(2n+1)= A003719(n), a(2n)= A000795(n), cf. A062161 (n mod 2).

Sequence in context: A140440 A005664 A009739 this_sequence A127137 A071787 A067578

Adjacent sequences: A062269 A062270 A062271 this_sequence A062273 A062274 A062275

KEYWORD

nonn,easy

AUTHOR

Frank.Ellermann(AT)t-online.de, Jun 16 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 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research