Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117549
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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.). +0
2
1, 3, 6, 10, 13, 16 (list; graph; listen)
OFFSET

1,2

COMMENT

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

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

CROSSREFS

Cf. A053006, A117548, A117550, A117551.

Sequence in context: A167219 A028357 A099822 this_sequence A028433 A080667 A001952

Adjacent sequences: A117546 A117547 A117548 this_sequence A117550 A117551 A117552

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Apr 21 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research