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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A213633 [A000027/A007978], where [ ] = floor. 4
0, 0, 1, 1, 2, 1, 3, 2, 4, 3, 5, 2, 6, 4, 7, 5, 8, 4, 9, 6, 10, 7, 11, 4, 12, 8, 13, 9, 14, 7, 15, 10, 16, 11, 17, 7, 18, 12, 19, 13, 20, 10, 21, 14, 22, 15, 23, 9, 24, 16, 25, 17, 26, 13, 27, 18, 28, 19, 29, 8, 30, 20, 31, 21, 32, 16, 33, 22, 34, 23, 35, 14, 36, 24, 37 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

a(n) = floor(n/m), where m is the least positive nondivisor of n, as in A007978.

LINKS

Table of n, a(n) for n=1..75.

EXAMPLE

a(10) = floor(10/3) = 3.

MATHEMATICA

y=120; z=2000;

t = Table[k := 1; While[Mod[n, k] == 0, k++];

   k, {n, 1, z}]  (*A007978*)

Table[Floor[n/t[[n]]], {n, 1, y}] (*A213633*)

Table[n - Floor[n/t[[n]]], {n, 1, y}] (*A213634*)

Table[t[[n]]*Floor[n/t[[n]]], {n, 1, y}] (*A213635*)

t1 = Table[n - t[[n]]*Floor[n/t[[n]]],

   {n, 1, z}] (* A213636 *)

Flatten[Position[t1, 1]] (* A213637 *)

Flatten[Position[t1, 2]] (* A213638 *)

CROSSREFS

Cf. A007978, A213634, A213635, A213636, A213637, A213638.

Sequence in context: A257902 A257909 A289439 * A289436 A282745 A097140

Adjacent sequences:  A213630 A213631 A213632 * A213634 A213635 A213636

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Jun 16 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 16 04:26 EDT 2019. Contains 325064 sequences. (Running on oeis4.)