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.

A271374 Total number of polydivisible numbers in base n.

Original entry on oeis.org

3, 16, 38, 128, 324, 1068, 2569, 8381, 20457, 58174, 148059, 441493, 916146, 3722968, 8407790, 23909586, 64576509, 178009925, 466027279, 1409607602, 3507905894, 9694292108, 25391646456, 73838562312, 191793924162, 550333004128
Offset: 2

Views

Author

Martin Renner, Apr 05 2016

Keywords

Examples

			There are a(10) = 20457 polydivisible numbers in base 10, which are listed in A144688.
		

Crossrefs

Row sums of A271373.

Formula

a(n) = Sum_{k=1..A109783(n)} A271373(n,k).
a(n) ~ (n-1)*(exp(n)-1)/n.

Extensions

a(16) from Seiichi Manyama, Sep 01 2019
a(17)-a(18) from Seiichi Manyama, Sep 02 2019
a(19)-a(27) from Max Alekseyev, Sep 08 2021