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!)
A117549 Values of n for which there exist d(1),...,d(n), each in {0,1,...,4} and an r in {1,...,4} such that Sum[d(i)d(i+k),i=1,n-k]=r (mod 5) for all k=0,...,n-1. (Such a sequence is called a very(5,r) sequence. See the link.). 1
1, 3, 6, 10, 13, 16 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Conjecture. Let A be a very(5,1) (respectively very(5,4)) sequence of length n and let Z be a sequence of n-1 0's.. Then AZ(3A)ZA is a very(5,1) (respectively very(5,4)) sequence of length 5n-2. (Here 3A denotes the result of multiplying each term of A by 3, then reducing modulo 5; and juxtaposition of symbols denotes concatenation of sequences.)
LINKS
CROSSREFS
Sequence in context: A310049 A168241 A099822 * A190767 A310050 A356469
KEYWORD
nonn,more
AUTHOR
John W. Layman, Apr 21 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 18 21:51 EDT 2024. Contains 371781 sequences. (Running on oeis4.)