Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056604
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056604 Values of LCM[1,...,m], m = prime, whose square-free kernels give A002110. +0
1
2, 6, 60, 420, 27720, 360360, 12252240, 232792560, 5354228880, 2329089562800, 72201776446800, 5342931457063200, 219060189739591200, 9419588158802421600, 442720643463713815200, 164249358725037825439200 (list; graph; listen)
OFFSET

1,1

COMMENT

a(n) can be used like A006939(n) for certain kinds of rounding. E.g. the Babylonian a(3) = 60 = 2*2*3*5 divides A006939(3) = 360 = 2*2*2*3*3*5.

FORMULA

a(n) = p(n)^r(n) *...* p(1)^r(1) for maximal p(j)^r(j) <= p(n).

EXAMPLE

a(5)=LCM[1,2,...,10,11]=27720, p(5)=11. Observe that not all possible LCM[1,..,n] values of A003418 occur; e.g. 12,840,25520,etc. are not present. Their square-free kernels gives exactly A002110.

CROSSREFS

Cf. A002110, A034386, A003418, A051451, A006939.

Sequence in context: A102290 A025540 A083135 this_sequence A086332 A089039 A108640

Adjacent sequences: A056601 A056602 A056603 this_sequence A056605 A056606 A056607

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Aug 07 2000

EXTENSIONS

One more term and additional comments from Frank.Ellermann(AT)t-online.de, Dec 18, 2001

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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research