login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085069 a(1) =1, then the smallest number a(n)== 1 ( mod a(n-1)) such that tau(a(n))= n. 1
1, 2, 9, 10, 81, 244, 4826809, 24134046, 258867666103225, 517735332206451 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(11) = (2*a(10)-1)^10, which is about 1.4*10^150, too large to include. - David Wasserman, Jan 20 2005
LINKS
EXAMPLE
a(4) = 10, a(5) = 81 == 1 (mod 10) and tau(81) = 5.
CROSSREFS
Cf. A085070.
Sequence in context: A363223 A338997 A363951 * A371163 A207670 A176545
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Jun 30 2003
EXTENSIONS
More terms from David Wasserman, Jan 20 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)