id:A095901 - OEIS Search Results

Search: id:A095901

Displaying 1-1 of 1 results found.

page 1

A004001 (mod 2).

+0
1

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

	OFFSET	`1,1`
	MATHEMATICA	`a[1] = a[2] = 1; a[n_] := a[n] = a[a[n - 1]] + a[n - a[n - 1]]; Table[ a[n], {n, 105}]`
	CROSSREFS	`Cf. A004001. The number of odd entries less than or equal to 2^n is in A095902.` `Sequence in context: A039985 A127239 A129186 this_sequence A087049 A118009 A113429` `Adjacent sequences: A095898 A095899 A095900 this_sequence A095902 A095903 A095904`
	KEYWORD	`easy,nonn`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 12 2004`

page 1

Search completed in 0.002 seconds

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.

AT&T Labs Research