Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055230
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055230 Greatest common divisor of largest square dividing n! and square-free part of n!. +0
9
1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 3, 3, 6, 10, 10, 10, 5, 5, 1, 21, 42, 42, 7, 7, 14, 42, 6, 6, 5, 5, 10, 330, 165, 231, 231, 231, 462, 2002, 5005, 5005, 4290, 4290, 390, 78, 39, 39, 13, 13, 26, 1326, 102, 102, 17, 935, 13090, 746130, 373065, 373065, 24871, 24871 (list; graph; listen)
OFFSET

1,4

FORMULA

a(n) = GCD[A008833(n!), A007913(n!)] = GCD[A008833(A000720(n)), A007913(A000720(n))]

CROSSREFS

A008833, A007913, A000188, A000720.

Sequence in context: A014695 A071017 A112049 this_sequence A112050 A078401 A086247

Adjacent sequences: A055227 A055228 A055229 this_sequence A055231 A055232 A055233

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jun 21 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research