

A182656


Floorsum sequence of r, with r=sqrt(3), and a(1)=1, a(2)=2.


3



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
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Let S be the set generated by these rules: (1) if m and n are in S and m<n, then floor(mr+nr) is in S; (2) two or more specific numbers are in S. The floorsum sequence determined by (1) and (2) results by arranging the elements of S in strictly increasing order.
Let B be the Beatty sequence of r. Then a floorsum sequence of r is a subsequence of B if and only if a(1) and a(2) are terms of B.


LINKS



EXAMPLE

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


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



