A276860 First differences of the Beatty sequence A276853 for 2*e.
5, 5, 6, 5, 6, 5, 6, 5, 5, 6, 5, 6, 5, 6, 5, 5, 6, 5, 6, 5, 6, 5, 6, 5, 5, 6, 5, 6, 5, 6, 5, 5, 6, 5, 6, 5, 6, 5, 6, 5, 5, 6, 5, 6, 5, 6, 5, 5, 6, 5, 6, 5, 6, 5, 6, 5, 5, 6, 5, 6, 5, 6, 5, 5, 6, 5, 6, 5, 6, 5, 5, 6, 5, 6, 5, 6, 5, 6, 5, 5, 6, 5, 6, 5, 6, 5
Offset: 1
Links
- Clark Kimberling, Table of n, a(n) for n = 1..10000
Programs
Formula
a(n) = floor(n*r) - floor(n*r - r), where r = 2e, n >= 1.