id:A153638 - OEIS Search Results

Search: id:A153638

Displaying 1-1 of 1 results found.

page 1

Odiousness of triangular numbers.

+0
1

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

	OFFSET	`0,1`
	COMMENT	`The odiousness of a number is equal to 1 if the number is odious, meaning that it has an odd number of ones in its binary expansion. Otherwise, it is zero.`
	EXAMPLE	`a(2) is 0, because the second triangular number is 3, which in binary is 11 and has an even number of ones.`
	MATHEMATICA	`od[n_] := Mod[Count[IntegerDigits[n, 2], 1], 2] Table[od[n (n + 1)/2], {n, 0, 128}]`
	CROSSREFS	`A000217 Triangular numbers.` `Sequence in context: A132151 A071037 A103588 this_sequence A122415 A071038 A109017` `Adjacent sequences: A153635 A153636 A153637 this_sequence A153639 A153640 A153641`
	KEYWORD	`nonn`
	AUTHOR	`Tanya Khovanova (tanyakh(AT)yahoo.com), Dec 29 2008`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research