login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058524 Each c(i) is "multiply" (*) or "divide" (/). a(n) is number of choices for c(1), ..., c(n-1) so that 1 c(1) 2 c(2) 3,.., c(n-1) n is an integer. 2
1, 1, 1, 2, 2, 8, 8, 13, 21, 77, 77, 128, 128, 354, 641, 1232, 1232, 2677, 2677, 7220, 8951, 25378, 25378, 63680, 113335, 323151, 532358, 1442702, 1442702, 2963955 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

EXAMPLE

For n = 4 there are 2 possibilities: 1*2*3*4=24 and 1/2*3*4=6. For n = 9 there are 13 possibilities: 1*2*3*4*5*6*7*8 1/2*3*4*5*6*7*8 1/2/3*4*5*6*7*8 1*2/3*4*5*6*7*8 1*2*3*4*5/6*7*8 1*2*3/4*5*6*7*8 1*2/3/4*5*6*7*8 1/2*3*4*5/6*7*8 1/2*3/4*5*6*7*8 1/2/3/4*5*6*7*8 1*2*3*4*5*6*7/8 1*2/3*4*5*6*7/8 1*2*3/4*5/6*7*8.

CROSSREFS

Sequence in context: A196066 A138102 A151924 * A072576 A060818 A082887

Adjacent sequences:  A058521 A058522 A058523 * A058525 A058526 A058527

KEYWORD

nonn,easy,nice

AUTHOR

Naohiro Nomoto (6284968128(AT)geocities.co.jp), Dec 22 2000

EXTENSIONS

More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Oct 14 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 20:38 EST 2012. Contains 205962 sequences.