id:A093663 - OEIS Search Results

Search: id:A093663

Displaying 1-1 of 1 results found.

page 1

Row sums of lower triangular matrix A093662.

+0
3

1, 2, 2, 5, 2, 5, 5, 17, 2, 5, 5, 17, 5, 17, 17, 86, 2, 5, 5, 17, 5, 17, 17, 86, 5, 17, 17, 86, 17, 86, 86, 698, 2, 5, 5, 17, 5, 17, 17, 86, 5, 17, 17, 86, 17, 86, 86, 698, 5, 17, 17, 86, 17, 86, 86, 698, 17, 86, 86, 698, 86, 698, 698, 9551 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(n) equals the number of sequences of length A000120(n-1) that satisfy an ordering restriction (cf. A016121), where A000120(n-1) is the number of 1's in the binary expansion of n-1.`
	FORMULA	`a(2^n) = A016121(n) for n>=0. a(2^n+2^m) = a(2^(m+1)) for n>m>=0.` `a(n) = A016121(A000120(n-1)) for n>=1.`
	CROSSREFS	`Cf. A016121, A093662, A093664.` `Cf. A000120.` `Sequence in context: A068066 A101910 A093660 this_sequence A011143 A018216 A059907` `Adjacent sequences: A093660 A093661 A093662 this_sequence A093664 A093665 A093666`
	KEYWORD	`nonn`
	AUTHOR	`Paul D. Hanna (pauldhanna(AT)juno.com), Apr 08 2004`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research