The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A083054 a(n) = floor(sqrt(3)*n) - 3*floor(n/sqrt(3)). 3
1, 0, 2, 0, 2, 1, 0, 1, 0, 2, 1, 2, 1, 0, 1, 0, 2, 1, 2, 1, 0, 2, 0, 2, 1, 0, 1, 0, 2, 0, 2, 1, 0, 1, 0, 2, 1, 2, 1, 0, 2, 0, 2, 1, 2, 1, 0, 2, 0, 2, 1, 0, 1, 0, 2, 0, 2, 1, 0, 1, 0, 2, 1, 2, 1, 0, 2, 0, 2, 1, 2, 1, 0, 2, 0, 2, 1, 0, 1, 0, 2, 1, 2, 1, 0, 1, 0, 2, 1, 2, 1, 0, 2, 0, 2, 1, 0, 1, 0, 2, 0, 2, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Boris Gourevitch, Graph of A083057
FORMULA
a(n) = floor(n*sqrt(3)) mod 3. - T. D. Noe, Oct 11 2006
PROG
(PARI) {a(n)=if(n<1, 0, sqrtint(3*n^2)-3*sqrtint(n^2\3))} /* Michael Somos, Aug 31 2006 */
CROSSREFS
Cf. A022383 (floor(n*sqrt(3))).
Sequence in context: A194702 A118682 A198393 * A336921 A297742 A061264
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Apr 18 2003
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 June 15 19:43 EDT 2024. Contains 373410 sequences. (Running on oeis4.)