login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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.). 1
1, 2, 5, 6, 7, 12, 14, 17, 20, 24 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
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
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
Sequence in context: A342792 A111300 A215761 * A175135 A244314 A014489
KEYWORD
nonn,more
AUTHOR
John W. Layman, Mar 28 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 09:15 EDT 2024. Contains 371967 sequences. (Running on oeis4.)