cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A324019 Triangle T(n,k) read by rows giving the number of k-digit zeroless polydivisible numbers in base n with 1 <= k <= n-1.

This page as a plain text file.
%I A324019 #27 Sep 16 2019 19:52:08
%S A324019 1,2,2,3,3,3,4,8,10,10,5,10,10,10,10,6,18,36,52,62,62,7,21,49,49,68,
%T A324019 68,68,8,32,64,128,205,205,233,233,9,36,108,216,216,324,416,416,416,
%U A324019 10,50,166,416,832,1382,1967,2465,2726,2726,11,55,165,330,726,726,1140,1140,1140,1140,1140
%N A324019 Triangle T(n,k) read by rows giving the number of k-digit zeroless polydivisible numbers in base n with 1 <= k <= n-1.
%C A324019 For k >= n there is no k-digit zeroless polydivisible number in base n.
%H A324019 Seiichi Manyama, <a href="/A324019/b324019.txt">Rows n = 2..18, flattened</a>
%H A324019 Wikipedia, <a href="https://en.wikipedia.org/wiki/Polydivisible_number">Polydivisible number</a>.
%e A324019 Triangle begins:
%e A324019 n\k  | 1   2    3    4    5    6    7    8    9
%e A324019 -----+------------------------------------------
%e A324019    2 | 1;
%e A324019    3 | 2,  2;
%e A324019    4 | 3,  3,   3;
%e A324019    5 | 4,  8,  10,  10;
%e A324019    6 | 5, 10,  10,  10,  10;
%e A324019    7 | 6, 18,  36,  52,  62,  62;
%e A324019    8 | 7, 21,  49,  49,  68,  68,  68;
%e A324019    9 | 8, 32,  64, 128, 205, 205, 233, 233;
%e A324019   10 | 9, 36, 108, 216, 216, 324, 416, 416, 416;
%Y A324019 Row sums give A324020.
%Y A324019 Cf. A271373, A327545.
%K A324019 nonn,tabl,base
%O A324019 2,2
%A A324019 _Seiichi Manyama_, Sep 01 2019