login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129454 Product{i=1..n}Product{j=1..n}Product{k=1..n} gcd(i,j,k). 4
1, 1, 1, 2, 6, 1536, 7680, 8806025134080, 61642175938560, 2168841254587541957294161920, 7562281854741110985626291951024209920, 1362299589723309231779453337910253309054734620740812800000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

Conjecture: Let p be a prime and let ordp(n,p) denote the largest power of p which divides n. For example, ordp(48,2)=4 since 48 = 3*(2^4). Then we conjecture that the prime factorization of a(n) is given by ordp(a(n),p)=(floor(n/p))^3 + (floor(n/p^2))^3 + (floor(n/p^3))^3 + . . .. Compare with the comments in A092287.

LINKS

Table of n, a(n) for n=0..11.

CROSSREFS

Cf. A092287, A129455.

Sequence in context: A252739 A178773 A046857 * A317251 A140258 A071093

Adjacent sequences:  A129451 A129452 A129453 * A129455 A129456 A129457

KEYWORD

nonn

AUTHOR

Peter Bala, Apr 16 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 27 15:49 EDT 2021. Contains 346308 sequences. (Running on oeis4.)