Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help


bibkey: perry2004a091915 authors: Jon Perry; Ralf Stephan year: 2004 title: “OEIS A091915, Maximum of even products of partitions of n” doi: null url: https://oeis.org/A091915 claim: “%N A091915 Maximum of even products of partitions of n. %F A091915 For n>6, a(n+3) = 3a(n) (conjectured). - Ralf Stephan, Dec 02 2004” strata_touched:

  • D5/S1/Recurrence/Partitions/StephanEvenProductPartitionRecurrence license: citation-only triage: anchor

OEIS A091915

The NAME and conjectural FORMULA lines state:

%N A091915 Maximum of even products of partitions of n. %F A091915 For n>6, a(n+3) = 3a(n) (conjectured). - Ralf Stephan, Dec 02 2004

The AUTHOR, OFFSET, and cross-reference lines state:

%A A091915 Jon Perry, Feb 12 2004 %O A091915 1,2 %Y A091915 Cf. A000792, A091916.

Verified locator

  • URL: https://oeis.org/A091915
  • NAME (verbatim): %N A091915 Maximum of even products of partitions of n.
  • FORMULA (verbatim): %F A091915 For n>6, a(n+3) = 3a(n) (conjectured). - Ralf Stephan, Dec 02 2004
  • AUTHOR (verbatim): %A A091915 Jon Perry, Feb 12 2004
  • OFFSET (verbatim): %O A091915 1,2
  • CROSS-REFERENCE (verbatim): %Y A091915 Cf. A000792, A091916.

Revision #12 (Jan 17 2016 09:04:01) still carries the formula with the word (conjectured). The sibling A091916 has Ron Knott’s 2020 closed forms, a generating function with denominator 3*x^3-1, and a linear-recurrence index entry with signature (0,0,3), while A091915 has none of those three.