Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120452
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A120452 Number of partitions of n-1 boys and one girl with no couple. +0
1
1, 1, 3, 5, 9, 14, 23, 34, 52, 75, 109, 153, 216, 296, 407, 549, 739, 981, 1300, 1702, 2224, 2879, 3716, 4761, 6083, 7721, 9774, 12306, 15450, 19307, 24064, 29867, 36978, 45614, 56130, 68846, 84250, 102793, 125148, 151955, 184123, 222553, 268482 (list; graph; listen)
OFFSET

1,3

FORMULA

a(n) = A000070(n-2) + A002865(n-1). - Fung Cheok Yin (cheokyin_restart(AT)yahoo.com.hk), Aug 15 2006

a(n) = A000070(n-1) - A000041(n-2) = A000070(n-3) + A000041(n-1). - Max Alekseyev (maxal(AT)cs.ucsd.edu), Aug 23 2006

EXAMPLE

n=5:

If partitions have no pair "o*", then a(5)=9 ("o" means a boy, "*" means a girl): {o, o, o, o, *}, {o, o, *, oo}, {*, oo, oo}, {o, *, ooo}, {o, o, oo*}, {oo, oo*}, {*, oooo}, {o, ooo*}, {oooo*}.

CROSSREFS

Cf. A000070.

Adjacent sequences: A120449 A120450 A120451 this_sequence A120453 A120454 A120455

Sequence in context: A053618 A032801 A033818 this_sequence A061556 A053993 A071155

KEYWORD

nonn,easy

AUTHOR

Yasutsohi Kohmoto zbi74583(AT)boat.zero.ad.jp, Jul 20 2006

EXTENSIONS

More terms from Fung Cheok Yin (cheokyin_restart(AT)yahoo.com.hk), Aug 15 2006

More terms from Max Alekseyev (maxal(AT)cs.ucsd.edu), Aug 23 2006

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 12 11:50 EDT 2008. Contains 144830 sequences.


AT&T Labs Research