A186636 a(n) = n*(n^3+n^2+2*n+1).

0, 5, 34, 129, 356, 805, 1590, 2849, 4744, 7461, 11210, 16225, 22764, 31109, 41566, 54465, 70160, 89029, 111474, 137921, 168820, 204645, 245894, 293089, 346776, 407525, 475930, 552609, 638204, 733381, 838830, 955265, 1083424, 1224069, 1377986, 1545985, 1728900, 1927589, 2142934, 2375841, 2627240

Offset: 0

Author

N. J. A. Sloane, Feb 24 2011

Keywords

• nonn
• easy
• changed

Comments

Number of lunar divisors of the number 11111 in base n+1.

From I. J. Kennedy, May 01 2025: (Start)

It appears that Table 10 of the Dismal Arithmetic paper matches the number of equivalence classes, with respect to matrix similarity, of k X k integer matrices under mod b-1 arithmetic. At least that's the case when b-1 is prime and we're dealing with a field GF(p).

For example, there are 805 lunar divisors of 1111_6, and there are 805 equivalence classes of 4 X 4 matrices over GF(5). (End)

Links

• D. Applegate, M. LeBrun and N. J. A. Sloane, Dismal Arithmetic [Note: we have now changed the name from "dismal arithmetic" to "lunar arithmetic" - the old name was too depressing]
• Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Programs

Mathematica

Table[n(n^3+n^2+2n+1),{n,0,40}] (* Harvey P. Dale, Nov 14 2024 *)