Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087560
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087560 Smallest m>n such that GCD(m,n^2)=n. +0
3
2, 6, 6, 12, 10, 30, 14, 24, 18, 30, 22, 60, 26, 42, 30, 48, 34, 90, 38, 60, 42, 66, 46, 120, 50, 78, 54, 84, 58, 210, 62, 96, 66, 102, 70, 180, 74, 114, 78, 120, 82, 210, 86, 132, 90, 138, 94, 240, 98, 150, 102, 156, 106, 270, 110, 168, 114, 174, 118, 420, 122 (list; graph; listen)
OFFSET

1,1

COMMENT

a(n)=n*A053669(n).

Equals n multiplied by the least nontrivial number coprime to n. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 20 2005

A000005(a(n)) = 2*A000005(n) = A062011(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 17 2006

CROSSREFS

Cf. A119416.

Adjacent sequences: A087557 A087558 A087559 this_sequence A087561 A087562 A087563

Sequence in context: A062562 A106832 A129902 this_sequence A071892 A064797 A053319

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 24 2003

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research