id:A065120 - OEIS Search Results

Search: id:A065120

Displaying 1-1 of 1 results found.

page 1

Highest power of 2 dividing A057335(n).

+0
5

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

	OFFSET	`0,3`
	COMMENT	`a(n) appears on row 1 of the array illustrated in A066099.` `Except for initial zero, ordinal transform of A062050. After initial zero, n-th chunk consists of n, one n-1, two (n-2)'s, ..., 2^{k-1} (n-k)'s, ..., 2^{n-1} 1's. - Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Sep 11 2006`
	EXAMPLE	`A057335(7)= 30 and 30 = 235 so a(7) = 1; A057335(9)= 24 and 24 = 8*3 so a(9) = 3`
	CROSSREFS	`Cf. A066099.` `Cf. A062050, A011782.` `Adjacent sequences: A065117 A065118 A065119 this_sequence A065121 A065122 A065123` `Sequence in context: A088192 A056062 A064034 this_sequence A103484 A016444 A026171`
	KEYWORD	`easy,nonn`
	AUTHOR	`Alford Arnold (Aford1940(AT)aol.com), Nov 12 2001`
	EXTENSIONS	`More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 29 2003`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research