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!)
 A135671 a(n) = ceiling(n - n^(2/3)). 8

%I

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

%T 20,21,22,22,23,24,25,26,26,27,28,29,30,30,31,32,33,34,34,35,36,37,38,

%U 39,39,40,41,42,43,44,44,45,46

%N a(n) = ceiling(n - n^(2/3)).

%H Vincenzo Librandi, <a href="/A135671/b135671.txt">Table of n, a(n) for n = 1..1000</a>

%t Table[Ceiling[n - n^(2/3)], {n, 100}] (* _Vincenzo Librandi_, Feb 16 2013 *)

%o (MAGMA) [Ceiling(n - n^(2/3)): n in [1..100]]; // _Vincenzo Librandi_, Feb 16 2013

%o (PARI) a(n)=n-sqrtnint(n^2,3) \\ _Charles R Greathouse IV_, Sep 02 2015

%Y Cf. A135660, A135661, A135662, A135663, A135664, A135665, A028391, A135668, A135669, A135670.

%K nonn,easy

%O 1,4

%A _Mohammad K. Azarian_, Nov 25 2007

%E Offset corrected by _Mohammad K. Azarian_, Nov 19 2008

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 July 30 15:29 EDT 2021. Contains 346359 sequences. (Running on oeis4.)