A110269 - OEIS

This site is supported by donations to The OEIS Foundation.

A110269

n mod 2 + n mod 3.

0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2, 1, 1, 3, 0, 2, 2 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	COMMENTS	`a(n) = A000035(n) + A010872(n).`
	CROSSREFS	`Cf. A110270.` `Sequence in context: A034853 A110283 A079692 * A120964 A184305 A157522` `Adjacent sequences: A110266 A110267 A110268 * A110270 A110271 A110272`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 18 2005`

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

Last modified February 16 17:11 EST 2012. Contains 205938 sequences.