Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058197
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058197 Where d(m) (number of divisors, A000005) rises by at least n. +0
3
1, 5, 11, 11, 23, 23, 47, 47, 59, 59, 119, 119, 167, 167, 179, 179, 239, 239, 359, 359, 359, 359, 719, 719, 719, 719, 719, 719, 839, 839, 1259, 1259, 1259, 1259, 1679, 1679, 2519, 2519, 2519, 2519, 2519, 2519, 2519, 2519, 3359, 3359, 5039, 5039, 5039, 5039 (list; graph; listen)
OFFSET

1,2

REFERENCES

D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, 1996, Section II.1.3.a.

EXAMPLE

d(11)=2, d(12)=6 gives first jump of >= 3, so a(3)=a(4)=11.

CROSSREFS

Equals A058198(n)-1.

Sequence in context: A061768 A060846 A113002 this_sequence A126243 A095805 A034596

Adjacent sequences: A058194 A058195 A058196 this_sequence A058198 A058199 A058200

KEYWORD

nonn,nice,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Nov 28 2000

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Nov 29 2000

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research