id:A130816 - OEIS Search Results

Search: id:A130816

Displaying 1-1 of 1 results found.

page 1

a(1) = 2 ; a(2) = 2 ; a(3) = 3 ; a(n) = a(n-3) + a(n-2)/2

+0
1

2, 2, 1, 3, 2, 2, 4, 3, 4, 5, 5, 6, 7, 8, 9, 11, 12, 14, 17, 19, 22, 26, 30, 35, 41, 47, 55, 64, 74, 87, 101, 117, 137, 159, 185, 216, 251, 293, 341, 397, 463, 539, 628, 732, 853, 994, 1158, 1350, 1573, 1833, 2136, 2489, 2901, 3380, 3939, 4591, 5349, 6234, 7265, 8466 (list; graph; listen)

	OFFSET	`4,1`
	COMMENT	`Resulted from a search for a suitable slowly increasing, not easily predictable but not random integer sequence for testing hard drive storage patterns.`
	EXAMPLE	`a(1) = 2 ; a(2) = 2 ; a(3) = 3 ; a(4) = 2 + 2/2 = 3 ; a(5) = 2 + 1/2 = 2`
	PROGRAM	`C: int f1 = 2; int f2 = 2; int f3 = 1; int next_seq() { int f = f1 + f2/2; f1 = f2; f2 = f3; f3 = f; return f; }`
	CROSSREFS	`Sequence in context: A039994 A112200 A112221 this_sequence A109951 A116608 A002947` `Adjacent sequences: A130813 A130814 A130815 this_sequence A130817 A130818 A130819`
	KEYWORD	`nonn`
	AUTHOR	`Ivan Voras (ivoras(AT)gmail.com), Jul 16 2007`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research