id:A084978 - OEIS Search Results

Search: id:A084978

Displaying 1-1 of 1 results found.

page 1

Number of ways to represent n as a+b*(c+d*(e+f*(...x+y*(z)...))) in positive integers.

+0
1

1, 2, 5, 11, 25, 51, 110, 221, 456, 918, 1864, 3729, 7528, 15057, 30227, 60485, 121205, 242411, 485337, 970675, 1942307, 3884730, 7771327, 15542655, 31089330, 62178686, 124364903, 248730268, 497475717, 994951435, 1989934099, 3979868199 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(n+1) = Sum(k=1..n; Sum(d\|k; a(d)).` `a(n+1) = 1 + Sum(k=1..n; Sum(d\|k; a(d)) or a(n+1) = a(n) + Sum(d\|n; a(d)). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Aug 08 2004`
	EXAMPLE	`a(3) = 5: 3 = 2+1(1) = 1+2(1) = 1+1(2) = 1+1(1+1(1)).`
	CROSSREFS	`Sequence in context: A071879 A134527 A124379 this_sequence A118036 A092685 A017919` `Adjacent sequences: A084975 A084976 A084977 this_sequence A084979 A084980 A084981`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net), Jun 16 2003`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research