Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083570
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083570 A de Bruijn sequence of length 9 over {0, 1, 2}, repeated. +0
1
0, 0, 1, 1, 2, 2, 1, 0, 2, 0, 0, 1, 1, 2, 2, 1, 0, 2, 0, 0, 1, 1, 2, 2, 1, 0, 2, 0, 0, 1, 1, 2, 2, 1, 0, 2, 0, 0, 1, 1, 2, 2, 1, 0, 2, 0, 0, 1, 1, 2, 2, 1, 0, 2, 0, 0, 1, 1, 2, 2, 1, 0, 2, 0, 0, 1, 1, 2, 2, 1, 0, 2, 0, 0, 1, 1, 2, 2, 1, 0, 2, 0, 0, 1, 1, 2, 2, 1, 0, 2, 0, 0, 1, 1, 2, 2, 1, 0, 2 (list; graph; listen)
OFFSET

0,5

COMMENT

Each of the 9 pairs 00, 01, ..., 22 occurs exactly once in each period.

REFERENCES

F. Mendivil, Fractals, graphs and fields, Amer. Math. Monthly, 110 (No. 6, 2003), 503-515.

FORMULA

a(n)=(1/36)*{9*(n mod 9)-7*[(n+1) mod 9]+5*[(n+2) mod 9]+5*[(n+3) mod 9]+[(n+4) mod 9]-3*[(n+5) mod 9]+[(n+6) mod 9]-3*[(n+7) mod 9]+[(n+8) mod 9]}, with n>=0. - Paolo P. Lava (ppl(AT)spl.at), Aug 24 2007

CROSSREFS

Sequence in context: A141335 A133624 A030110 this_sequence A153240 A153241 A096830

Adjacent sequences: A083567 A083568 A083569 this_sequence A083571 A083572 A083573

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jun 14 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 November 24 19:42 EST 2009. Contains 167435 sequences.


AT&T Labs Research