Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062968
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062968 n + 1 - d(n), where d(n) is the number of divisors function. +0
2
1, 1, 2, 2, 4, 3, 6, 5, 7, 7, 10, 7, 12, 11, 12, 12, 16, 13, 18, 15, 18, 19, 22, 17, 23, 23, 24, 23, 28, 23, 30, 27, 30, 31, 32, 28, 36, 35, 36, 33, 40, 35, 42, 39, 40, 43, 46, 39, 47, 45, 48, 47, 52, 47, 52, 49, 54, 55, 58, 49, 60, 59, 58, 58, 62, 59, 66, 63, 66, 63, 70, 61, 72 (list; graph; listen)
OFFSET

1,3

PROGRAM

(PARI) j=[]; for(n=1, 150, j=concat(j, numdiv(n)-n-1)); j

CROSSREFS

Cf. A062969.

Sequence in context: A029578 A054345 A060367 this_sequence A053197 A088145 A011754

Adjacent sequences: A062965 A062966 A062967 this_sequence A062969 A062970 A062971

KEYWORD

nonn

AUTHOR

Jason Earls (jcearls(AT)cableone.net), Jul 23 2001

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 July 4 18:25 EDT 2008. Contains 140886 sequences.


AT&T Labs Research