Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056612
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056612 GCD(n!, n!(1+1/2+1/3+...+1/n)). +0
4
1, 1, 1, 2, 2, 36, 36, 144, 144, 1440, 1440, 17280, 17280, 241920, 3628800, 29030400, 29030400, 1567641600, 1567641600, 156764160000, 9876142080000, 217275125760000, 217275125760000, 1738201006080000, 1738201006080000 (list; graph; listen)
OFFSET

1,4

COMMENT

The first difference between this sequence and A131657 occurs for n=20, while the first difference between this sequence and A131658 occurs for n=21. - Christian Krattenthaler (christian.krattenthaler(AT)univie.ac.at), Sep 30 2007

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

FORMULA

a(n)=A000142(n)/A002805(n)=A000254(n)/A001008(n). - Franz Vrabec (franz.vrabec(AT)planetuniqa.at), Sep 13 2005

EXAMPLE

a(4) = GCD(4!, 4!(1+1/2+1/3+1/4)) =GCD(24, 50) = 2.

CROSSREFS

Cf. A007757, A131657, A131658.

Sequence in context: A018976 A074127 A024176 this_sequence A131658 A131657 A059523

Adjacent sequences: A056609 A056610 A056611 this_sequence A056613 A056614 A056615

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Aug 08 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research