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!)
A255338 Each n occurs A255337(n) times. 4

%I #6 Feb 21 2015 15:38:19

%S 0,1,2,3,4,4,5,6,7,7,8,8,9,9,10,11,12,13,13,14,14,14,15,15,16,16,17,

%T 17,18,18,19,20,21,22,22,23,23,23,24,24,25,25,25,26,26,26,27,27,28,29,

%U 29,30,30,30,31,31,32,32,33,33,34,34,35,36,37,38,38,39,39,39,40,40,41,41,41,42,42

%N Each n occurs A255337(n) times.

%H Antti Karttunen, <a href="/A255338/b255338.txt">Table of n, a(n) for n = 0..8192</a>

%F a(n) = The least k such that A255057(k) >= n.

%o (Scheme, with _Antti Karttunen_'s IntSeq-library)

%o (define A255338 (LEAST-GTE-I 0 0 A255057))

%Y The first differences gives A255339, the characteristic function of A255057.

%Y Cf. A255337.

%K nonn

%O 0,3

%A _Antti Karttunen_, Feb 21 2015

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 24 10:53 EDT 2024. Contains 371936 sequences. (Running on oeis4.)