login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051190 Product of n's GCD's with all of its predecessors (from 1 to n-1). 2
1, 1, 1, 2, 1, 12, 1, 16, 9, 80, 1, 3456, 1, 448, 2025, 2048, 1, 186624, 1, 1024000, 35721, 11264, 1, 573308928, 625, 53248, 59049, 179830784, 1, 1007769600000, 1, 67108864, 7144929, 1114112, 37515625, 160489808068608, 1, 4980736, 89813529 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

LINKS

T. D. Noe, Table of n, a(n) for n=1..200

MAPLE

A051190 := proc(n) local i; product(igcd(n, 'i'), 'i'=1..(n-1)); end;

PROG

(Haskell)

a051190 n = product $ map (gcd n) [1..n-1]

-- Reinhard Zumkeller, Nov 22 2011

CROSSREFS

Cf. A006579.

Sequence in context: A161150 A163088 A105608 * A072512 A118588 A174500

Adjacent sequences:  A051187 A051188 A051189 * A051191 A051192 A051193

KEYWORD

nonn,nice

AUTHOR

Antti Karttunen Oct 21 1999

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 18:33 EST 2012. Contains 205535 sequences.