id:A060584 - OEIS Search Results

Search: id:A060584

Displaying 1-1 of 1 results found.

page 1

Compare ultimate and penultimate digits of n base 3, i.e. 0 if n mod 3 = floor[n/3] mod 3, 1 otherwise; also 0 if (n mod 9) is a multiple of 4, 1 otherwise.

+0
2

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

	OFFSET	`0,1`
	FORMULA	`a(n) =a(n-9) =(A060585(n) mod 2). G.f.: x(1+x+x^2)(1+x^4)/(1-x^9).`
	CROSSREFS	`Sequence in context: A101264 A095770 A140318 this_sequence A098725 A046978 A075553` `Adjacent sequences: A060581 A060582 A060583 this_sequence A060585 A060586 A060587`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Apr 04 2001`

page 1

Search completed in 0.002 seconds

Last modified July 4 18:25 EDT 2008. Contains 140886 sequences.

AT&T Labs Research