Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A004976
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A004976 a(n) = floor(n*phi^3), where phi = (1+sqrt(5))/2. +0
7
0, 4, 8, 12, 16, 21, 25, 29, 33, 38, 42, 46, 50, 55, 59, 63, 67, 72, 76, 80, 84, 88, 93, 97, 101, 105, 110, 114, 118, 122, 127, 131, 135, 139, 144, 148, 152, 156, 160, 165, 169, 173, 177, 182, 186, 190, 194, 199 (list; graph; listen)
OFFSET

0,2

LINKS

Index entries for sequences related to Beatty sequences

FORMULA

a(n) = n + floor(2 n phi). [Formula corrected by Clark Kimberling, Mar 22 2008]

CROSSREFS

Cf. A000201, A001950, A004919.

Sequence in context: A164086 A109238 A102861 this_sequence A071385 A066192 A097981

Adjacent sequences: A004973 A004974 A004975 this_sequence A004977 A004978 A004979

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 5 08:23 EST 2009. Contains 170348 sequences.


AT&T Labs Research