Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083035
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083035 a(n)=floor(sqrt(2)*n)-2*floor(n/sqrt(2)). +0
9
1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n) = floor(n*sqrt(2)) mod 2 - T. D. Noe (noe(AT)sspectra.com), Oct 11 2006

CROSSREFS

Cf. A083036, A083037, A083038.

Cf. A001951 (floor(n*sqrt(2))).

Sequence in context: A078650 A028863 A089012 this_sequence A051341 A057211 A120531

Adjacent sequences: A083032 A083033 A083034 this_sequence A083036 A083037 A083038

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 17 2003

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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research