id:A068912 - OEIS Search Results

Search: id:A068912

Displaying 1-1 of 1 results found.

page 1

Number of n step walks (each step +/-1 starting from 0) which are never more than 3 or less than -3.

+0
3

1, 2, 4, 8, 14, 28, 48, 96, 164, 328, 560, 1120, 1912, 3824, 6528, 13056, 22288, 44576, 76096, 152192, 259808, 519616, 887040, 1774080, 3028544, 6057088, 10340096, 20680192, 35303296, 70606592, 120532992, 241065984, 411525376, 823050752 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`G.f.: (1+2x)/(1-4x^2+2x^4). a(n)=A068913(3, n)=4a(n-2)-2a(n-4). a(2n)=A007070(n)=2a(2n-1)-A060995(n); a(2n+1)=2a(2n).`
	CROSSREFS	`Cf. A000007, A016116 (without initial term), A068911, A068913 for similar.` `Adjacent sequences: A068909 A068910 A068911 this_sequence A068913 A068914 A068915` `Sequence in context: A122026 A118034 A096590 this_sequence A018086 A004651 A118560`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 06 2002`

page 1

Search completed in 0.002 seconds

Last modified October 6 12:54 EDT 2008. Contains 144667 sequences.

AT&T Labs Research