Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069805
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069805 Smallest k>n such that tau(n) divides tau(k)=A000005(k). +0
1
2, 3, 5, 9, 6, 8, 8, 10, 12, 14, 12, 18, 14, 15, 21, 48, 18, 20, 20, 28, 22, 24, 24, 30, 28, 27, 30, 32, 30, 40, 32, 44, 34, 35, 38, 100, 38, 39, 40, 42, 42, 54, 44, 45, 50, 51, 48, 80, 50, 52, 54, 60, 54, 56, 56, 66, 58, 60, 60, 72, 62, 65, 68, 192, 66, 70, 68, 72, 70, 78, 72 (list; graph; listen)
OFFSET

1,1

PROGRAM

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

CROSSREFS

Sequence in context: A119628 A021093 A011026 this_sequence A123923 A045965 A100674

Adjacent sequences: A069802 A069803 A069804 this_sequence A069806 A069807 A069808

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research