id:A140081 - OEIS Search Results

Search: id:A140081

Displaying 1-1 of 1 results found.

page 1

Period 4: repeat 0,1,1,2.

+0
3

0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1 (list; graph; listen)

	OFFSET	`0,4`
	COMMENT	`Also fix e = 4; then a(n) = minimal Hamming distance between the binary representation of n and the binary representation of any multiple ke (0 <= k <= n/e) which is a child of n.` `A number m is a child of n if the binary representation of n has a 1 in every position where the binary representation of m has a 1.`
	FORMULA	`a(n)=(1/12){8(n mod 4)-[(n+1) mod 4]+2[(n+2) mod 4]-[(n+3) mod 4]}, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 06 2008` `a(n)=1-(1/4)(1-I)I^n-(1/2)(-1)^n-(1/4)(1+I)(-I)^n, with n>=0 and I=sqrt(-1) - Paolo P. Lava (ppl(AT)spl.at), Jul 17 2008`
	PROGRAM	`See link in A140080 for Fortran program.`
	CROSSREFS	`Sequence in context: A101660 A062984 A105243 this_sequence A112345 A124763 A029372` `Adjacent sequences: A140078 A140079 A140080 this_sequence A140082 A140083 A140084`
	KEYWORD	`nonn`
	AUTHOR	`Nadia Heninger (nadiah(AT)cs.princeton.edu) and njas, Jun 03 2008`

page 1

Search completed in 0.002 seconds

Last modified December 3 14:12 EST 2008. Contains 151279 sequences.

AT&T Labs Research