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.

A182656 Floor-sum sequence of r, with r=sqrt(3), and a(1)=1, a(2)=2.

Original entry on oeis.org

1, 2, 5, 10, 12, 19, 20, 22, 24, 25, 29, 34, 36, 38, 39, 41, 43, 45, 46, 50, 51, 53, 55, 58, 60, 62, 64, 65, 67, 69, 71, 72, 74, 76, 77, 79, 81, 83, 84, 86, 88, 90, 91, 93, 95, 96, 98, 100, 102, 103, 105, 107, 109, 110, 112, 114, 116, 117
Offset: 1

Views

Author

Clark Kimberling, Nov 26 2010

Keywords

Comments

Let S be the set generated by these rules: (1) if m and n are in S and m
Let B be the Beatty sequence of r. Then a floor-sum sequence of r is a subsequence of B if and only if a(1) and a(2) are terms of B.

Examples

			a(3)=floor(r+2r)=5.
		

Crossrefs