A000572 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A000572

A Beatty sequence: [ n(e+1) ].
(Formerly M2621 N1037)

3, 7, 11, 14, 18, 22, 26, 29, 33, 37, 40, 44, 48, 52, 55, 59, 63, 66, 70, 74, 78, 81, 85, 89, 92, 96, 100, 104, 107, 111, 115, 118, 122, 126, 130, 133, 137, 141, 145, 148, 152, 156, 159, 163, 167, 171, 174, 178, 182, 185, 189, 193, 197, 200, 204, 208, 211, 215, 219

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

REFERENCES

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

T. D. Noe, Table of n, a(n) for n = 1..1000

I. G. Connell, Some properties of Beatty sequences II, Canad. Math. Bull., 3 (1960), 17-22.

Index entries for sequences related to Beatty sequences

MAPLE

for n from 1 to 200 do printf(`%d, `, floor( n*(exp(1)+1))) od: