login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) is the largest of all positive integers whose partitions into consecutive parts can be totally represented in the first n rows of the table described in A286000.
8

%I #23 Oct 21 2017 21:06:42

%S 1,2,2,4,4,5,5,8,8,8,9,9,11

%N a(n) is the largest of all positive integers whose partitions into consecutive parts can be totally represented in the first n rows of the table described in A286000.

%C a(n) has the same definition related to the table A286001 which is another version of the table A286000.

%C First differs from A288774 at a(12), which shares infinitely many terms.

%e Figures A, B, C show the evolution of the table of partitions into consecutive parts described in A286000, with 11, 12 and 13 rows respectively:

%e . ------------------------------------------------------

%e Figure: A B C

%e ------------------------------------------------------------

%e . n = 11 12 13

%e Row ------------------------------------------------------

%e 1 | 1; | 1; | 1; |

%e 1 | 2; | 2; | 2; |

%e 3 | 3, 2; | 3, 2; | 3, 2; |

%e 4 | 4, 1; | 4, 1; | 4, 1; |

%e 5 | 5, 3; | 5, 3; | 5, 3; |

%e 6 | 6, 2, 3; | 6, 2, 3; | 6, 2, 3; |

%e 7 | 7, 4, 2; | 7, 4, 2; | 7, 4, 2; |

%e 8 | 8, 3, 1; | 8, 3, 1; | 8, 3, 1; |

%e 9 | [9],[5],[4]; | [9],[5],[4]; | 9, 5, 4; |

%e 10 | 10, [4],[3], 4;| 10, [4],[3], 4;| 10, 4, 3; 4;|

%e 11 | 11, 6, [2], 3;| 11, 6, [2]; 3;| [11],[6], 2, 3;|

%e 12 | | 12, 5, 5, 2;| 12, [5], 5, 2;|

%e 13 | | | 13, 7, 4, 1;|

%e . ------------------------------------------------------

%e . a(n): 9 9 11

%e . ------------------------------------------------------

%e For n = 11, in the first 11 rows of the table can be represented the partitions into consecutive parts of the integers 1, 2, 3, 4, 5, 6, 7, 8 and 9. The largest of these positive integers is 9, so a(11) = 9.

%e For n = 12, in the first 12 rows of the table can be represented the partitions into consecutive parts of the integers 1, 2, 3, 4, 5, 6, 7, 8, 9 and 11. The largest of these positive integers is 11, but the partitions into consecutive parts of 10 cannot be represented, so a(12) = 9, not 11.

%e For n = 13, in the first 13 rows of the table can be represented the partitions into consecutive parts of the integers 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 and 11. The largest of these positive integers is 11, so a(13) = 11.

%Y Cf. A237593, A286000, A286001, A288529, A288772, A288774.

%K nonn,more

%O 1,2

%A _Omar E. Pol_, Jun 17 2017