OFFSET
0,2
COMMENTS
a(n) = A000225(n) * A024023(n) = (2^n - 1) * (3^n - 1) . a(n) is the number of n-tuples of elements e_1,e_2,...,e_n in the cyclic group C_6 such that the subgroup generated by e_1,e_2,...,e_n is C_6. - Sharon Sela (sharonsela(AT)hotmail.com), Jun 02 2002
Szalay proves that this sequence contains no squares except for 0. He & Liu prove that this sequence contains no higher powers aside from 2. - Charles R Greathouse IV, Jan 10 2025
REFERENCES
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 199, #3.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..300
Bo He and Chang Liu, The diophantine equation (2^k-1)*(3^k-1)=x^n, arXiv preprint (2025). arXiv:2501.04050 [math.NT].
Index entries for linear recurrences with constant coefficients, signature (12,-47,72,-36).
FORMULA
G.f.: -2*x*(6*x^2-1) / ((x-1)*(2*x-1)*(3*x-1)*(6*x-1)). - Colin Barker, Dec 06 2012
a(n-1) = (limit of (Sum_{k>=0} (1/(6*k + 1)^s - 1/(6*k + 2)^s - 2/(6*k + 3)^s - 1/(6*k + 4)^s + 1/(6*k + 5)^s + 2/(6*k + 6)^s) as s -> n))/zeta(n)*6^(n - 1). - Mats Granvik, Nov 14 2013
a(n) = 2*A160869(n). - R. J. Mathar, Nov 23 2018
MAPLE
MATHEMATICA
Table[(2^n-1)*(3^n-1), {n, 0, 5!}] (* Vladimir Joseph Stephan Orlovsky, Apr 28 2010 *)
PROG
(Magma) [(2^n-1)*(3^n-1): n in [0..30]]; // Vincenzo Librandi, Jun 05 2011
(PARI) for(n=0, 30, print1((2^n-1)*(3^n-1), ", ")) \\ G. C. Greubel, Jan 29 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jan 29 2001
STATUS
approved