id:A050605 - OEIS Search Results

Search: id:A050605

Displaying 1-1 of 1 results found.

page 1

Column/row 2 of A050602: a(n) = add3c(n,2).

+0
3

0, 0, 1, 1, 0, 0, 2, 2, 0, 0, 1, 1, 0, 0, 3, 3, 0, 0, 1, 1, 0, 0, 2, 2, 0, 0, 1, 1, 0, 0, 4, 4, 0, 0, 1, 1, 0, 0, 2, 2, 0, 0, 1, 1, 0, 0, 3, 3, 0, 0, 1, 1, 0, 0, 2, 2, 0, 0, 1, 1, 0, 0, 5, 5, 0, 0, 1, 1, 0, 0, 2, 2, 0, 0, 1, 1, 0, 0, 3, 3, 0 (list; graph; listen)

	OFFSET	`0,7`
	COMMENT	`It seems that (n-sum(k=1,n,a(k))/log(n) is bounded - Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 03 2002` `2^a(n) is the highest power of 2 dividing the n-th triangular number n*(n+1)/2 - Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 03 2002`
	PROGRAM	`(PARI) a(n)=valuation(n*(n+1)/2, 2)`
	CROSSREFS	`Bisection gives column/row 1 of A050602: A007814.` `Sequence in context: A058190 A055736 A006997 this_sequence A060571 A131555 A103822` `Adjacent sequences: A050602 A050603 A050604 this_sequence A050606 A050607 A050608`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen Jun 22 1999`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research