id:A153587 - OEIS Search Results

Search: id:A153587

Displaying 1-1 of 1 results found.

page 1

a(n) = n mod (A062383[n]-n)

+0
1

0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 4, 1, 0, 1, 0, 0, 0, 2, 4, 6, 8, 10, 2, 5, 0, 4, 2, 2, 0, 2, 0, 0, 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 1, 4, 7, 10, 13, 0, 4, 8, 12, 4, 9, 4, 1, 0, 1, 4, 4, 0, 1, 0, 0 (list; graph; listen)

	OFFSET	`0,6`
	PROGRAM	`(Other) int A062383(int n) { if(n==0) return 1; return 2*(A062383(n/2)); } int a(int n) { return n % (A062383(n)-n); }`
	CROSSREFS	`A062383` `Sequence in context: A126164 A145007 A151670 this_sequence A059286 A076998 A083927` `Adjacent sequences: A153584 A153585 A153586 this_sequence A153588 A153589 A153590`
	KEYWORD	`easy,nonn`
	AUTHOR	`J. Z. Bradley (jzbradley(AT)gmail.com), Dec 29 2008`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research