login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003152 A Beatty sequence: a(n) = floor(n*(1+1/sqrt(2))).
(Formerly M2392)
8
1, 3, 5, 6, 8, 10, 11, 13, 15, 17, 18, 20, 22, 23, 25, 27, 29, 30, 32, 34, 35, 37, 39, 40, 42, 44, 46, 47, 49, 51, 52, 54, 56, 58, 59, 61, 63, 64, 66, 68, 69, 71, 73, 75, 76, 78, 80, 81, 83, 85, 87, 88, 90, 92, 93, 95, 97, 99, 100, 102, 104, 105, 107, 109, 110, 112, 114, 116 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

The g.f. (z+1)*(z**6+2*z**4+z**2+z+1)/(z**6+z**5+z**4+z**3+z**2+z+1)/(z-1)**2 conjectured by S. Plouffe in his 1992 dissertation is wrong.

REFERENCES

L. Carlitz, R. Scoville and V. E. Hoggatt, Jr., Pellian representatives, Fib. Quart., 10 (1972), 449-488.

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

LINKS

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

Index entries for sequences related to Beatty sequences

MAPLE

Digits := 100: t := evalf(1+sin(Pi/4)): A:= n->floor(t*n): seq(floor((t*n)), n=1..68); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 27 2009]

CROSSREFS

Complement of A003151.

Cf. A109250.

Sequence in context: A138235 A059541 A189682 * A193599 A068125 A139437

Adjacent sequences:  A003149 A003150 A003151 * A003153 A003154 A003155

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Erich Friedman (erich.friedman(AT)stetson.edu).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 19:42 EST 2012. Contains 205948 sequences.