id:A033539 - OEIS Search Results

Search: id:A033539

Displaying 1-1 of 1 results found.

page 1

a(0)=1, a(1)=1, a(2)=1, a(n)=2*a(n-1)+a(n-2)+1.

+0
2

1, 1, 1, 4, 10, 25, 61, 148, 358, 865, 2089, 5044, 12178, 29401, 70981, 171364, 413710, 998785, 2411281, 5821348, 14053978, 33929305, 81912589, 197754484, 477421558, 1152597601, 2782616761, 6717831124, 16218279010, 39154389145 (list; graph; listen)

	OFFSET	`0,4`
	COMMENT	`Number of times certain simple recursive programs call themselves.`
	LINKS	`A. Karttunen, More information`
	PROGRAM	`(PARI) rev(n)=cnt++; if(n<=2, n >= 0, rev(n-1); rev(n-2); rev(n-1); 1); for(n=0, 50, cnt=0; print(n" "rev(n)" "cnt))`
	CROSSREFS	`Cf. A033538.` `Sequence in context: A111153 A111207 A113412 this_sequence A020748 A021004 A020709` `Adjacent sequences: A033536 A033537 A033538 this_sequence A033540 A033541 A033542`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`Antti Karttunen`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research