A133196 - OEIS

This site is supported by donations to The OEIS Foundation.

A133196

n+2 repeated n times.

3, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,1`
	LINKS	`Table of n, a(n) for n=0..78.`
	FORMULA	`a(n)=2+A002024 - Paolo P. Lava, Dec 19 2007` `a(n)=A003056(n)+3, a(n)=A003057(n)+1; a(n) = t+3, where t=floor((-1+sqrt(8*n-7))/2). - Boris Putievskiy, May 07 2013`
	CROSSREFS	`Cf. A002024, A003056, A003057.` `Sequence in context: A201006 A107574 A053405 * A179841 A059183 A182280` `Adjacent sequences: A133193 A133194 A133195 * A133197 A133198 A133199`
	KEYWORD	`nonn,changed`
	AUTHOR	`Paul Curtz, Oct 09 2007`
	STATUS	`approved`

Content is available under The OEIS End-User License Agreement .

Last modified May 19 22:31 EDT 2013. Contains 225436 sequences.