Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117548
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117548 Values of n for which there exist d(1),...,d(n), each in {0,1,2}, and an r in {1,2} such that Sum[d(i)d(i+k),i=1,n-k]=r (mod 3) for all k=0,...,n-1. (Such a sequence is called a very(3,r) sequence. See the link.). +0
2
1, 2, 5, 6, 7, 12, 14, 17, 20, 24 (list; graph; listen)
OFFSET

1,2

COMMENT

Theorem. Let a be a very(3,r) sequence of length n, for r=1 or 2, and let z be a sequence of n-1 0's. Then az(2a) is a very(3,3-r) sequence of length 3n-1, where 2a denotes the sequence {2a(i) mod 3, i=1,...,n}.

LINKS

John W. Layman, On A Generalization of Very Odd Sequences

EXAMPLE

For the sequence d=112102 we get Sum[d(i)d(i+k),i=1,n-k]={11,5,5,5,2,2}= {2,2,2,2,2,2) (mod 3) for k=0,...,5, so 6 is a term of the sequence.

CROSSREFS

Cf. A053006, A117549-A117551.

Sequence in context: A103025 A134080 A111300 this_sequence A014489 A033959 A090946

Adjacent sequences: A117545 A117546 A117547 this_sequence A117549 A117550 A117551

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Mar 28 2006

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research