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.

A194979 a(n) = 1 + floor(n/sqrt(3)).

Original entry on oeis.org

1, 2, 2, 3, 3, 4, 5, 5, 6, 6, 7, 7, 8, 9, 9, 10, 10, 11, 11, 12, 13, 13, 14, 14, 15, 16, 16, 17, 17, 18, 18, 19, 20, 20, 21, 21, 22, 22, 23, 24, 24, 25, 25, 26, 26, 27, 28, 28, 29, 29, 30, 31, 31, 32, 32, 33, 33, 34, 35, 35, 36, 36, 37, 37, 38, 39, 39, 40, 40, 41, 41
Offset: 1

Views

Author

Clark Kimberling, Sep 07 2011

Keywords

Comments

The fractalization of this sequence is A194980.
Least number k such that k*tan(1/k) - 1 < 1/n^2. - Clark Kimberling, Dec 02 2014
The integers k such that a(k) = a(k+1) give A054406. - Michel Marcus, Nov 01 2021

Crossrefs

Programs

Formula

a(n) = 1 + A097337(n).