Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060700
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060700 "Anomalous" numbers x=a(n) such that for even numbers 2x, GCD[2x,LCM[dd[2x]]]=2x and not x; dd[2x] is the first difference set of divisors of 2x. +0
1
15, 30, 35, 45, 63, 70, 75, 77, 91, 99, 105, 117, 126, 135, 140, 143, 150, 153, 154, 165, 175, 182, 187, 189, 195, 198, 209, 221, 225, 231, 234, 245, 247, 252, 255, 273, 280, 285, 286, 297, 299, 306, 308, 315, 323, 325, 330, 345, 350, 351, 357, 364, 374, 375 (list; graph; listen)
OFFSET

1,1

EXAMPLE

63 is here because for 126 = 2*63, GCD[126, LCM[dd[126]]] = GCD[126, 1260] = 126, LCM[dd[126]] = LCM[1, 1, 3, 1, 2, 5, 4, 3, 21, 21, 63] = 126.

CROSSREFS

A060680-A060685, A060741, A060742, A060763-A060766, A000005.

Sequence in context: A033898 A051967 A079877 this_sequence A131933 A056917 A044855

Adjacent sequences: A060697 A060698 A060699 this_sequence A060701 A060702 A060703

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 25 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 00:03 EDT 2008. Contains 143485 sequences.


AT&T Labs Research