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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066740 Number of distinct partitions of A007504(n) which can be obtained by merging parts in the partition 2+3+5+...+prime(n), where prime(n) is the n-th prime. 1
1, 1, 2, 5, 13, 44, 151, 614, 2446, 11066, 53368, 253927, 1316375, 7213979 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

EXAMPLE

For n=4, the 13 partitions are 17, 2+15, 3+14, 5+12, 7+10, 8+9, 2+3+12, 2+5+10, 2+7+8, 3+5+9, 3+7+7, 5+5+7, 2+3+5+7. 5+12 and 7+10 can be obtained in two ways each: 5+12 = (5)+(2+3+7) = (2+3)+(5+7), 7+10 = (7)+(2+3+5) = (2+5)+(3+7).

MATHEMATICA

addto[ p_, k_ ] := Module[ {}, lth=Length[ p ]; Union[ Sort/@Append[ Table[ Join[ Take[ p, i-1 ], {p[ [ i ] ]+k}, Take[ p, i-lth ] ], {i, 1, lth} ], Append[ p, k ] ] ] ]; addtolist[ plist_, k_ ] := Union[ Join@@(addto[ #, k ]&/@plist) ]; l[ 0 ]={{}}; l[ n_ ] := l[ n ]=addtolist[ l[ n-1 ], Prime[ n ] ]; a[ n_ ] := Length[ l[ n ] ]

CROSSREFS

Cf. A007504, A066723.

Sequence in context: A178682 A192745 A119533 * A000719 A149875 A085632

Adjacent sequences:  A066737 A066738 A066739 * A066741 A066742 A066743

KEYWORD

more,nonn

AUTHOR

Naohiro Nomoto (n_nomoto(AT)yabumi.com), Jan 16 2002

EXTENSIONS

Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jan 18 2002

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 14 20:38 EST 2012. Contains 205663 sequences.