Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137179
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137179 a(n) = the smallest positive integer m such that d(m) + d(m+1) = n, where d(m) is the number of positive divisors of m. (a(n) is the smallest m where A092405(m) = n.). +0
1
1, 2, 3, 5, 8, 11, 15, 20, 24, 39, 35, 59, 80, 84, 195, 167, 120, 119, 224, 239, 399, 335, 440, 359, 360, 480, 1520, 539, 899, 719, 1224, 720, 840, 1079, 3135, 1259, 5183, 1260, 2400, 2160, 1680, 1679, 9408, 2880, 7056, 2639, 3024, 2520, 6240, 2519, 7055, 6929 (list; graph; listen)
OFFSET

3,2

MATHEMATICA

a = {}; For[n = 3, n < 60, n++, i = 1; While[ ! DivisorSigma[0, i] + DivisorSigma[0, i + 1] == n, i++ ]; AppendTo[a, i]]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 18 2008

CROSSREFS

Cf. A092405.

Sequence in context: A126097 A131073 A062485 this_sequence A096777 A125811 A071424

Adjacent sequences: A137176 A137177 A137178 this_sequence A137180 A137181 A137182

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), May 11 2008

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 18 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 September 7 23:08 EDT 2008. Contains 143486 sequences.


AT&T Labs Research