The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A276333 The most significant digit in greedy A001563-base (A276326): a(n) = floor(n/A258199(n)), a(0) = 0. 7
0, 1, 2, 3, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(0) = 0; for n >= 1, a(n) = floor(n/A258199(n)).
MATHEMATICA
Table[Floor[n/(# #!)] &@ NestWhile[# + 1 &, 0, # #! <= n &[# + 1] &], {n, 96}] (* or *)
f[n_] := Block[{a = {{0, n}}}, Do[AppendTo[a, {First@#, Last@#} &@ QuotientRemainder[a[[-1, -1]], (# #!) &[# - i]]], {i, 0, # - 1}] &@ NestWhile[# + 1 &, 0, (# #!) &[# + 1] <= n &]; Rest[a][[All, 1]]]; {0}~Join~Table[First@ f@ n, {n, 96}] (* Michael De Vlieger, Aug 31 2016 *)
PROG
(Scheme) (define (A276333 n) (if (zero? n) n (floor->exact (/ n (A258199 n)))))
CROSSREFS
Sequence in context: A327462 A255824 A122587 * A347380 A308638 A356320
KEYWORD
nonn
AUTHOR
Antti Karttunen, Aug 30 2016
STATUS
approved

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 June 5 01:34 EDT 2024. Contains 373102 sequences. (Running on oeis4.)