login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023419 a(n) = c([ n/2 ]) + c([ n/3 ]) + ... + c([ n/n ]) for n >=3, where a(1) = 1, a(2) = 2 and c(n) = n-th number not in sequence a( ). 0

%I #4 Mar 30 2012 18:55:51

%S 1,2,6,10,13,18,21,27,31,36,39,47,50,56,61,68,71,79,82,90,96,101,104,

%T 114,118,124,130,139,142,152,155,163,168,173,179,191,194,199,205,216,

%U 219,229,232,240,249,255,258,270,275,282,287,296,299,310

%N a(n) = c([ n/2 ]) + c([ n/3 ]) + ... + c([ n/n ]) for n >=3, where a(1) = 1, a(2) = 2 and c(n) = n-th number not in sequence a( ).

%K nonn

%O 1,2

%A _Clark Kimberling_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 17:37 EDT 2024. Contains 371795 sequences. (Running on oeis4.)