login
A358349
A puzzle array read by antidiagonals.
1
1, 2, 1, 3, 3, 1, 4, 9, 4, 1, 5, 21, 31, 5, 1, 6, 41, 220, 129, 6, 1, 7, 71, 1081, 6949, 651, 7, 1, 8, 113, 3992, 244769, 897072, 3913, 8, 1, 9, 169, 12015, 4560121, 1701796853, 583997785, 27399, 9, 1, 10, 241, 31112, 52524001, 1117878053902, 1526634890512201
OFFSET
1,2
REFERENCES
Ben Hamilton, Brainteasers and Mindbenders, Fireside, 1992, p. 51.
LINKS
Sean A. Irvine, Java program (github)
FORMULA
T(1,m) = m, T(n,1) = 1, T(n,m) = T(n-1,m-1) * T(n-1,m) + T(n,m-1).
EXAMPLE
Original puzzle ("May 5" in Hamilton):
1, 2, 3, 4, 5;
1, 3, 9, 21, 41;
1, 4, 31, 220, 1081;
1, 5, 129, 6949, ?.
CROSSREFS
Sequence in context: A089944 A374738 A180165 * A376479 A142249 A274705
KEYWORD
nonn,easy,tabl
AUTHOR
Sean A. Irvine, Dec 02 2022
STATUS
approved