Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005647
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005647 Salie numbers.
(Formerly M3066)
+0
8
1, 1, 3, 19, 217, 3961, 105963, 3908059, 190065457, 11785687921, 907546301523, 84965187064099, 9504085749177097, 1251854782837499881, 191781185418766714683, 33810804270120276636139, 6796689405759438360407137, 1545327493049348356667631841 (list; graph; listen)
OFFSET

0,3

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 87, Problem 32.

LINKS

T. D. Noe, Table of n, a(n) for n=0..100

FORMULA

Expand cosh x / cos x and multiply coefficients by n!/(2^(n/2)).

a(n) = 2^(-n)*Sum_{k=0..n} A000364(k)*binomial(2*n, 2*k)). - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Jul 30 2003

CROSSREFS

a(n) = A000795(n)/2^n.

Sequence in context: A058165 A074707 A135749 this_sequence A158876 A001833 A001035

Adjacent sequences: A005644 A005645 A005646 this_sequence A005648 A005649 A005650

KEYWORD

nonn,easy,nice

AUTHOR

Simon Plouffe (simon.plouffe(AT)gmail.com), N. J. A. Sloane (njas(AT)research.att.com).

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research