Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069806
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069806 Smallest k>n such that the square-free par of n divides the square-free part of k. +0
1
2, 6, 6, 5, 10, 24, 14, 10, 10, 30, 22, 15, 26, 42, 30, 17, 34, 22, 38, 30, 42, 66, 46, 30, 26, 78, 30, 35, 58, 120, 62, 34, 66, 102, 70, 37, 74, 114, 78, 70, 82, 168, 86, 55, 55, 138, 94, 51, 50, 54, 102, 65, 106, 66, 110, 70, 114, 174, 118, 105, 122, 186, 70, 65 (list; graph; listen)
OFFSET

1,1

PROGRAM

(PARI) for(s=1, 100, n=s+1; while(frac(core(n)/core(s))>0, n++); print1(n, ", "); )

CROSSREFS

Sequence in context: A110388 A007507 A065486 this_sequence A123945 A097466 A141624

Adjacent sequences: A069803 A069804 A069805 this_sequence A069807 A069808 A069809

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 01 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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research