A095901 - OEIS

This site is supported by donations to The OEIS Foundation.

A095901

A004001 (mod 2).

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; refs; listen; history; internal format)

	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 * A087049 A118009 A113429` `Adjacent sequences: A095898 A095899 A095900 * A095902 A095903 A095904`
	KEYWORD	`easy,nonn`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 12 2004`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 04:47 EST 2012. Contains 205860 sequences.