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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A123313 Maximum of greatest common divisors of pairs of distinct squarefree numbers not greater than n; a(1)=1. 2
1, 1, 1, 1, 3, 3, 5, 5, 5, 7, 7, 7, 7, 7, 11, 11, 13, 13, 15, 15, 15, 17, 17, 17, 19, 19, 19, 21, 21, 23, 23, 23, 23, 23, 23, 29, 29, 29, 31, 31, 33, 33, 33, 35, 35, 35, 37, 37, 39, 39, 41, 41, 41, 43, 43, 43, 43, 43, 47, 47, 47, 47, 51, 51, 51, 53, 53, 53, 55, 55, 55, 57, 57, 59 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

COMMENTS

A123314(n) = #{k: a(k) = A005117(n)}.

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..10000

Eric Weisstein's World of Mathematics, Squarefree

Ind ex entries for sequences related to GCD's.

FORMULA

a(n) = Max(a(n-1), Max(GCD(A005117(n), A005117(k)): 1<=k<n).

CROSSREFS

Sequence in context: A196386 A035158 A196172 * A131507 A203998 A075260

Adjacent sequences:  A123310 A123311 A123312 * A123314 A123315 A123316

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 25 2006

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 15 08:45 EST 2012. Contains 205737 sequences.