Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071888
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071888 a(1)=2 and for n>1 a(n) = least square-free m > n with gcd(m,n)>1. +0
6
2, 6, 6, 6, 10, 10, 14, 10, 15, 14, 22, 14, 26, 21, 21, 22, 34, 21, 38, 22, 30, 26, 46, 26, 30, 30, 30, 30, 58, 33, 62, 34, 39, 38, 42, 38, 74, 42, 42, 42, 82, 46, 86, 46, 51, 58, 94, 51, 70, 55, 57, 58, 106, 57, 65, 58, 66, 62, 118, 62, 122, 66, 66, 66 (list; graph; listen)
OFFSET

1,1

COMMENT

A071889(n)=gcd(a(n),n); A071890(n)=a(n)-n;

For n>2: n is prime iff a(n)=n*2.

CROSSREFS

Cf. A005117, A071891, A071892.

Sequence in context: A103643 A079892 A096014 this_sequence A117217 A161331 A120627

Adjacent sequences: A071885 A071886 A071887 this_sequence A071889 A071890 A071891

KEYWORD

nonn,nice

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 10 2002

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research