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
3, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 20, 21, 22, 23, 23, 24, 25, 25, 26, 27, 27, 28, 29, 29, 30, 31, 31, 32, 33, 33, 34, 34, 35, 36, 36, 37, 37, 38, 38, 39, 40, 40, 41, 41, 42, 42, 43, 43, 44, 44, 45, 45, 46, 46, 47, 47, 48, 48, 49, 49, 50, 50, 51, 51, 52 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = ceiling(3*n^(2/3)).
EXAMPLE
a(8) = 12 because ceiling(3*8^(2/3)) = ceiling(12) = 12.
MATHEMATICA
Table[Ceiling[3*n^(2/3)], {n, 1, 85}]
CROSSREFS
Cf. A102889.
Sequence in context: A036593 A086674 A137203 * A008520 A217129 A336340
KEYWORD
easy,nonn
AUTHOR
Joseph Biberstine (jrbibers(AT)indiana.edu), Jan 16 2005
STATUS
approved

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 30 07:52 EDT 2024. Contains 372127 sequences. (Running on oeis4.)