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!)
A078451 a(1)=1, a(n) = ceiling(n/a(a(n-1))). 1

%I #11 Jul 05 2019 02:27:23

%S 1,2,2,2,3,3,4,4,5,4,6,4,7,4,8,4,9,4,10,5,7,6,8,6,9,6,9,6,10,8,8,8,9,

%T 7,9,8,10,10,10,10,11,7,11,8,12,12,12,12,13,8,13,8,14,14,14,14,15,8,

%U 15,8,16,16,16,16,17,8,17,8,18,18,18,18,19,8,19,8,20,16,20,16,21,12,21,12,22

%N a(1)=1, a(n) = ceiling(n/a(a(n-1))).

%C If u(1)=1 u(n)=ceiling(n/u(n-1)) then u(2k)=2 and u(2k+1)=k

%H Michael De Vlieger, <a href="/A078451/b078451.txt">Table of n, a(n) for n = 1..10000</a>

%t Nest[Append[#, Ceiling[(Length[#] + 1)/#[[#[[-1]] ]] ]] &, {1}, 84] (* _Michael De Vlieger_, Jul 04 2019 *)

%K nonn

%O 1,2

%A _Benoit Cloitre_, Dec 31 2002

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 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)