id:A099741 - OEIS Search Results

Search: id:A099741

Displaying 1-1 of 1 results found.

page 1

a(1) = 1; a(n) = a([n/2])+a([n/3]) (n >= 2).

+0
1

1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 20, 20, 20, 20, 20, 20, 20, 20, 20, 21 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`Let f = f[x,y] be a Fibonacci variant with recurrence f(1) = f(2) = 1; f(n) = f(ceiling((n-1)/x))+f(ceiling((n-2)/y)). This sequence is f[2,3].` `Nondecreasing. Increases only when n is of the form 2^x*3^y.`
	EXAMPLE	`a(19) = a([19/2])+a([19/3]) = a(9)+a(6) = 4+3 = 7.`
	CROSSREFS	`Sequence in context: A081832 A034887 A082964 this_sequence A047743 A062299 A157685` `Adjacent sequences: A099738 A099739 A099740 this_sequence A099742 A099743 A099744`
	KEYWORD	`easy,nonn`
	AUTHOR	`Darrell Minor (dminor(AT)cscc.edu), Nov 09 2004`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research