A053616 - OEIS

This site is supported by donations to The OEIS Foundation.

A053616

Pyramidal sequence: distance to nearest triangular number.

0, 0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 2, 2, 1, 0, 1, 2, 3, 2, 1, 0, 1, 2, 3, 3, 2, 1, 0, 1, 2, 3, 4, 3, 2, 1, 0, 1, 2, 3, 4, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 6, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 7, 6, 5, 4, 3, 2, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,9`
	LINKS	`T. D. Noe, Table of n, a(n) for n=0..1000`
	EXAMPLE	`a(12)=\|12-10\|=2 since 10 is the nearest triangular number to 12`
	CROSSREFS	`Cf. A000217, A002262, A053188.` `Sequence in context: A177405 A170984 A114021 * A094718 A076191 A025861` `Adjacent sequences: A053613 A053614 A053615 * A053617 A053618 A053619`
	KEYWORD	`easy,nice,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 20 2000`

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

Last modified February 17 00:09 EST 2012. Contains 205978 sequences.