This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A321667 #14 Nov 17 2018 21:06:21 %S A321667 2,2,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,10,11,11,11,12,12,12,13,13,14,14, %T A321667 14,14,15,15,15,16,16,16,17,17,17,18,18,18,18,19,19,19,20,20,20,20,21, %U A321667 21,21,21,22,22,22,22,23,23,23,23,24,24,24,24,25,25,25,25,26,26,26,26,27 %N A321667 (3/2) * n^(2/3) rounded to nearest integer. %C A321667 This is an approximation to the solution of the "Concrete Math Club" casino problem given in A079631. %D A321667 R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. 2nd Edition. Addison-Wesley, Reading, MA, 1994. Section 3.2, pp. 74-76. %H A321667 Hugo Pfoertner, <a href="/A321667/b321667.txt">Table of n, a(n) for n = 1..10000</a> %t A321667 a[n_]:=Round[(3/2)*n^(2/3)]; Array[a, 50] (* _Stefano Spezia_, Nov 16 2018 *) %o A321667 (PARI) for(j=1,75,print1(round(1.5*j^(2/3)),", ")) %o A321667 (Python) for n in range(1,50): print(round((3/2)*n**(2/3)), end=', ') # _Stefano Spezia_, Nov 16 2018 %Y A321667 Cf. A079631. %K A321667 nonn,easy %O A321667 1,1 %A A321667 _Hugo Pfoertner_, Nov 16 2018