id:A132424 - OEIS Search Results

Search: id:A132424

Displaying 1-1 of 1 results found.

page 1

a(0)=1 and, for n>0, a(n)=a(Floor((n-1)/a[n-1]))+2.

+0
2

1, 3, 3, 3, 5, 3, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 7, 5, 7, 5, 7, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 5, 7, 5, 7, 5, 7, 5, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`Records occur at {0,1,4,21,148,1333,14664,190633,2859496,48611433,...} for n=1,2,3,..., which appears to be given by r(n+1)=(2n-1)r(n)+1. See A130147 for a related sequence.`
	CROSSREFS	`Cf. A130147.` `Sequence in context: A125958 A132448 A132450 this_sequence A070864 A076566 A083574` `Adjacent sequences: A132421 A132422 A132423 this_sequence A132425 A132426 A132427`
	KEYWORD	`nonn`
	AUTHOR	`John W. Layman (layman(AT)math.vt.edu), Aug 20 2007`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research