id:A130667 - OEIS Search Results

Search: id:A130667

Displaying 1-1 of 1 results found.

page 1

a(1) = 1; a(n) = max { 5*a(k)+a(n-k) | 1 <= k <= n/2 }, for n>1.

+0
4

1, 6, 11, 36, 41, 66, 91, 216, 221, 246, 271, 396, 421, 546, 671, 1296, 1301, 1326, 1351, 1476, 1501, 1626, 1751, 2376, 2401, 2526, 2651, 3276, 3401, 4026, 4651, 7776, 7781, 7806, 7831, 7956, 7981, 8106, 8231, 8856, 8881, 9006, 9131, 9756, 9881, 10506, 11131 (list; graph; listen)

	OFFSET	`1,2`
	REFERENCES	`D. E. Knuth, Problem submitted to Amer. Math. Monthly, Jun 18 2007.`
	FORMULA	`a(2n)=6a(n) and a(2n+1)=5a(n)+a(n+1).`
	CROSSREFS	`Cf. A006046, A130666, A130665.` `Adjacent sequences: A130664 A130665 A130666 this_sequence A130668 A130669 A130670` `Sequence in context: A105508 A114960 A100093 this_sequence A108698 A002570 A038265`
	KEYWORD	`nonn`
	AUTHOR	`njas, based on a message from D. E. Knuth, Jun 23 2007`

page 1

Search completed in 0.002 seconds

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.

AT&T Labs Research