login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A328675 Number of integer partitions of n with no two distinct consecutive parts divisible. 2
1, 1, 2, 2, 3, 3, 4, 5, 6, 8, 9, 13, 13, 22, 23, 30, 36, 50, 54, 77, 85, 113, 135, 170, 194, 256, 303, 369, 440, 545, 640, 792, 931, 1132, 1347, 1616, 1909, 2295, 2712, 3225, 3799, 4519, 5310, 6278, 7365, 8675, 10170, 11928, 13940, 16314, 19046, 22223, 25856 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
EXAMPLE
The a(1) = 1 through a(10) = 9 partitions (A = 10).
1 2 3 4 5 6 7 8 9 A
11 111 22 32 33 43 44 54 55
1111 11111 222 52 53 72 64
111111 322 332 333 73
1111111 2222 432 433
11111111 522 532
3222 3322
111111111 22222
1111111111
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], !MatchQ[Union[#], {___, x_, y_, ___}/; Divisible[y, x]]&]], {n, 0, 30}]
CROSSREFS
The Heinz numbers of these partitions are given by A328674.
The case involving all consecutive parts (not just distinct) is A328171.
The version for relative primality instead of divisibility is A328187.
Partitions with all consecutive parts divisible are A003238.
Compositions without consecutive divisibilities are A328460.
Sequence in context: A015741 A015753 A005686 * A365072 A118082 A120160
KEYWORD
nonn
AUTHOR
Gus Wiseman, Oct 29 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 05:19 EDT 2024. Contains 371782 sequences. (Running on oeis4.)