Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140128
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A140128 A positive integer n is included if d(d(n)) = d(d(n+1)), where d(n) is the number of divisors of n. +0
1
2, 3, 4, 14, 16, 21, 26, 33, 34, 35, 38, 44, 57, 75, 85, 86, 93, 94, 98, 104, 116, 118, 122, 133, 135, 141, 142, 145, 147, 152, 153, 158, 164, 170, 171, 174, 175, 177, 188, 189, 201, 202, 205, 207, 213, 214, 217, 218, 225, 230, 231, 242, 243, 244, 245 (list; graph; listen)
OFFSET

1,1

FORMULA

For m = 2,3,4,5..., a(m) is the smallest integer > a(m-1) such that A010553(a(m)) = A010553(a(m)+1).

EXAMPLE

35 has 4 divisors, and 4 has 3 divisors. 36 has 9 divisors, and 9 has 3 divisors. Since d(d(35)) = d(d(36)) (=3), then 35 is included in the sequence.

MATHEMATICA

Select[Range[250], DivisorSigma[0, DivisorSigma[0, # ]] == DivisorSigma[0, DivisorSigma[0, # + 1]] &] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 05 2008

CROSSREFS

Cf. A010553.

Sequence in context: A039576 A091907 A103048 this_sequence A100998 A127283 A047193

Adjacent sequences: A140125 A140126 A140127 this_sequence A140129 A140130 A140131

KEYWORD

nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jun 04 2008

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 05 2008

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 December 3 14:12 EST 2008. Contains 151279 sequences.


AT&T Labs Research