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!)
A102890 A102889(n) is at least a(n). 1

%I #5 Jun 14 2019 00:27:52

%S 3,5,7,8,9,10,11,12,13,14,15,16,17,18,19,20,20,21,22,23,23,24,25,25,

%T 26,27,27,28,29,29,30,31,31,32,33,33,34,34,35,36,36,37,37,38,38,39,40,

%U 40,41,41,42,42,43,43,44,44,45,45,46,46,47,47,48,48,49,49,50,50,51,51,52

%N A102889(n) is at least a(n).

%F a(n) = ceiling(3*n^(2/3)).

%e a(8) = 12 because ceiling(3*8^(2/3)) = ceiling(12) = 12.

%t Table[Ceiling[3*n^(2/3)], {n, 1, 85}]

%Y Cf. A102889.

%K easy,nonn

%O 1,1

%A Joseph Biberstine (jrbibers(AT)indiana.edu), Jan 16 2005

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 August 18 17:05 EDT 2024. Contains 375269 sequences. (Running on oeis4.)