The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A244317 n occurs A014138(n) times. 2

%I

%S 0,1,2,2,2,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,4,4,4,

%T 4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,

%U 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6

%N n occurs A014138(n) times.

%C For n >= 1, a(n) = 1 + the least k such that A014143(k) >= n.

%C Useful when computing A244314.

%F For all n >= 0, a(A014143(n)) = n+1 and a(1+A014143(n)) = n+2.

%o (Scheme) (define (A244317 n) (if (zero? n) n (let loop ((k 0)) (if (>= (A014143 k) n) (+ 1 k) (loop (+ 1 k))))))

%Y Cf. A014138, A014143, A244314, A072643, A081288, A244160.

%K nonn,easy

%O 0,3

%A _Antti Karttunen_, Jul 18 2014

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.

Last modified September 29 07:08 EDT 2020. Contains 337425 sequences. (Running on oeis4.)