id:A126306 - OEIS Search Results

Search: id:A126306

Displaying 1-1 of 1 results found.

page 1

a(n) = number of double-rises (UU-subsequences) in the n-th Dyck path encoded by A014486(n).

+0
4

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

	OFFSET	`0,9`
	FORMULA	`a(n) = A014081(A014486(n)).`
	EXAMPLE	`A014486(20) = 228 (11100100 in binary), encodes the following Dyck path:` `../\` `./..\/\` `/......\` `and there is one rising (left-hand side) slope with length 3, and one with length 1, so in the first slope, consisting of 3 U-steps, there are two cases with two consecutive U-steps (overlapping is allowed), thus a(20)=2.`
	CROSSREFS	`a(n) = A000120(A048735(A014486(n))). a(A125976(n)) = A057514(n)-1, for all n >= 1.` `Sequence in context: A121444 A118230 A025889 this_sequence A029402 A035196 A051160` `Adjacent sequences: A126303 A126304 A126305 this_sequence A126307 A126308 A126309`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), Jan 02 2007`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research