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”).

A305715
Irregular triangle whose rows are all finite sequences of positive integers that are polydivisible and strictly pandigital.
3
1, 1, 2, 1, 2, 3, 3, 2, 1, 1, 2, 3, 6, 5, 4, 3, 2, 1, 6, 5, 4, 3, 8, 1, 6, 5, 4, 7, 2, 3, 8, 1, 6, 5, 4, 7, 2, 9, 3, 8, 1, 6, 5, 4, 7, 2, 9, 10
OFFSET
1,3
COMMENTS
A positive integer sequence q of length k is strictly pandigital if it is a permutation of {1,2,...,k}. It is polydivisible if Sum_{i = 1...m} 10^(m - i) * q_i is a multiple of m for all 1 <= m <= k.
REFERENCES
Matt Parker, Things to make and do in the fourth dimension, 2015, pages 7-9.
EXAMPLE
Triangle is:
{1}
{1,2}
{1,2,3}
{3,2,1}
{1,2,3,6,5,4}
{3,2,1,6,5,4}
{3,8,1,6,5,4,7,2}
{3,8,1,6,5,4,7,2,9}
{3,8,1,6,5,4,7,2,9,10}
MATHEMATICA
polyQ[q_]:=And@@Table[Divisible[FromDigits[Take[q, k]], k], {k, Length[q]}];
Flatten[Table[Select[Permutations[Range[n]], polyQ], {n, 8}]]
KEYWORD
base,fini,tabf,full,nonn
AUTHOR
Gus Wiseman, Jun 08 2018
STATUS
approved