A103128 - OEIS

This site is supported by donations to The OEIS Foundation.

A103128

n appears 2 * ceiling(n/2) times.

1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,3`
	LINKS	`Reinhard Zumkeller, Table of n, a(n) for n = 1..10000`
	FORMULA	`a(n) = floor(sqrt(2n-1)).`
	PROG	`(Haskell)` `a103128 = a000196 . (subtract 1) . (* 2)` `-- Reinhard Zumkeller, Feb 12 2012`
	CROSSREFS	`Cf. A172471, A000196, A005408.` `Sequence in context: A146323 A071626 A106457 * A156080 A107320 A095186` `Adjacent sequences: A103125 A103126 A103127 * A103129 A103130 A103131`
	KEYWORD	`easy,nonn,changed`
	AUTHOR	`Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Mar 17 2005`
	EXTENSIONS	`Edited by Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Apr 20 2010`

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

Last modified February 16 13:48 EST 2012. Contains 205920 sequences.