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

%I #10 Aug 31 2016 20:56:03

%S 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,

%T 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,

%U 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

%N The most significant digit in greedy A001563-base (A276326): a(n) = floor(n/A258199(n)), a(0) = 0.

%H Antti Karttunen, <a href="/A276333/b276333.txt">Table of n, a(n) for n = 0..4320</a>

%F a(0) = 0; for n >= 1, a(n) = floor(n/A258199(n)).

%t Table[Floor[n/(# #!)] &@ NestWhile[# + 1 &, 0, # #! <= n &[# + 1] &], {n, 96}] (* or *)

%t 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 *)

%o (Scheme) (define (A276333 n) (if (zero? n) n (floor->exact (/ n (A258199 n)))))

%Y Cf. A001563, A276326, A258199, A276334, A276335.

%K nonn

%O 0,3

%A _Antti Karttunen_, Aug 30 2016

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 July 23 11:07 EDT 2024. Contains 374549 sequences. (Running on oeis4.)