login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079427 Least m > n having the same number of divisors as n, a(1)=1. 3
1, 3, 5, 9, 7, 8, 11, 10, 25, 14, 13, 18, 17, 15, 21, 81, 19, 20, 23, 28, 22, 26, 29, 30, 49, 27, 33, 32, 31, 40, 37, 44, 34, 35, 38, 100, 41, 39, 46, 42, 43, 54, 47, 45, 50, 51, 53, 80, 121, 52, 55, 63, 59, 56, 57, 66, 58, 62, 61, 72, 67, 65, 68, 729, 69, 70, 71, 75, 74, 78, 73 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

tau(a(n)) = tau(n) and tau(i) <> tau(n), n<i<a(n) (tau=A000005);

a(A000040(k)) = A079428(A000040(k)) = A000040(k+1), as A000005(p)=2 for primes p.

EXAMPLE

Sets of divisors for n=10,11,12,13 and 14: D(10)={1,2,5,10}, D(11)={1,11}, D(12)={1,2,3,4,6,12}, D(13)={1,13}, D(14)={1,2,7,14}: therefore a(10)=14 (#D(10)=#D(14)).

CROSSREFS

Cf. A112275, A112276.

Sequence in context: A048639 A021282 A016613 * A168271 A081761 A003961

Adjacent sequences:  A079424 A079425 A079426 * A079428 A079429 A079430

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 08 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 01:31 EST 2012. Contains 205860 sequences.