Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066690
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066690 Odd n such that tau(n)=tau(n+2)=10, where tau(n)=A000005(n) is the number of divisors of n. +0
1
127251, 649375, 1274373, 1303047, 2206519, 2388123, 2775625, 3400623, 3585625, 3627909, 4193125, 4294375, 4311873, 5707177, 6319375, 6336873, 6926875, 7128567, 7939375, 7949581, 8101537, 11280625, 11298123, 11786875 (list; graph; listen)
OFFSET

0,1

MATHEMATICA

Do[ If[ DivisorSigma[0, 2n - 1] == DivisorSigma[0, 2n + 1] == 10, Print[2n - 1]], {n, 1, 10^7} ]

PROGRAM

(PARI) for (n=1, 2000000, if ((numdiv(2*n-1)==10) && (numdiv(2*n+1)==10), write("tau=tau=10.txt", 2*n-1, "::", tau(2*n-1))))

CROSSREFS

Sequence in context: A048936 A133220 A023086 this_sequence A114668 A128038 A013893

Adjacent sequences: A066687 A066688 A066689 this_sequence A066691 A066692 A066693

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), Jan 11 2002

EXTENSIONS

Edited by Dean Hickerson (dean(AT)math.ucdavis.edu), Jan 13, 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 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research