cp's OEIS Frontend

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.

A321667 (3/2) * n^(2/3) rounded to nearest integer.

Original entry on oeis.org

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, 14, 14, 15, 15, 15, 16, 16, 16, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 23, 23, 23, 23, 24, 24, 24, 24, 25, 25, 25, 25, 26, 26, 26, 26, 27
Offset: 1

Views

Author

Hugo Pfoertner, Nov 16 2018

Keywords

Comments

This is an approximation to the solution of the "Concrete Math Club" casino problem given in A079631.

References

  • R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. 2nd Edition. Addison-Wesley, Reading, MA, 1994. Section 3.2, pp. 74-76.

Crossrefs

Cf. A079631.

Programs

  • Mathematica
    a[n_]:=Round[(3/2)*n^(2/3)]; Array[a, 50] (* Stefano Spezia, Nov 16 2018 *)
  • PARI
    for(j=1,75,print1(round(1.5*j^(2/3)),", "))
    
  • Python
    for n in range(1,50): print(round((3/2)*n**(2/3)), end=', ') # Stefano Spezia, Nov 16 2018