id:A055087 - OEIS Search Results

Search: id:A055087

Displaying 1-1 of 1 results found.

page 1

Integers 0..n then 0..n then 0..n+1 then 0..n+1 etc.

+0
4

0, 0, 0, 1, 0, 1, 0, 1, 2, 0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 6, 0, 1, 2, 3, 4, 5, 6, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1 (list; graph; listen)

	OFFSET	`0,9`
	LINKS	`M. Somos, Sequences used for indexing triangular or square arrays`
	EXAMPLE	`0, 0, 0,1, 0,1, 0,1,2, 0,1,2, 0,1,2,3, 0,1,2,3, ...`
	PROGRAM	`(PARI) a(n)=(1+4n-sqr(floor(sqrt(1+4n))))\4`
	CROSSREFS	`Sequence in context: A096771 A129714 A022333 this_sequence A025685 A163325 A105186` `Adjacent sequences: A055084 A055085 A055086 this_sequence A055088 A055089 A055090`
	KEYWORD	`nonn,easy`
	AUTHOR	`Michael Somos`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research