Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130223
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130223 Number of partitions of n-set in which number of blocks of size 2k-1 is odd (or zero) for every k. +0
4
1, 1, 1, 5, 8, 42, 117, 541, 2403, 10485, 65778, 282262, 2284493, 9977853, 97315935, 450358629, 4966934284 (list; graph; listen)
OFFSET

0,4

FORMULA

E.g.f.: exp(cosh(x)-1)*Product_{k>0} (1+sinh(x^(2*k-1)/(2*k-1)!)).

CROSSREFS

Cf. A102759.

Adjacent sequences: A130220 A130221 A130222 this_sequence A130224 A130225 A130226

Sequence in context: A032790 A075273 A073930 this_sequence A126750 A109292 A117474

KEYWORD

easy,more,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Aug 05 2007, Aug 05 2007

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 October 6 12:54 EDT 2008. Contains 144667 sequences.


AT&T Labs Research