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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062968 n + 1 - d(n), where d(n) is the number of divisors function. 4
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; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

A062968 = n - A070824 [From Eric Desbiaux (moongerms(AT)wanadoo.fr), Dec 10 2009]

FORMULA

a(n) = n+1-A000005(n) = A049820(n)-1. [From Omar E. Pol (info(AT)polprimos.com), Jul 16 2009]

PROG

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

CROSSREFS

Cf. A062969.

Cf. A000005, A049820. [From Omar E. Pol (info(AT)polprimos.com), Jul 16 2009]

Sequence in context: A029578 A054345 A060367 * A053197 A088145 A011754

Adjacent sequences:  A062965 A062966 A062967 * A062969 A062970 A062971

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jul 23 2001

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 14 08:17 EST 2012. Contains 205607 sequences.