A022856 - OEIS

This site is supported by donations to The OEIS Foundation.

A022856

a(n) = n-2 + Sum of a(i+1)mod(a(i)) for i = 1 to n-2, for n >= 3.

1, 1, 1, 2, 3, 5, 8, 12, 17, 23, 30, 38, 47, 57, 68, 80, 93, 107, 122, 138, 155, 173, 192, 212, 233, 255, 278, 302, 327, 353, 380, 408, 437, 467, 498, 530, 563, 597, 632, 668, 705, 743, 782, 822, 863, 905, 948, 992, 1037, 1083, 1130, 1178, 1227 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,4`
	COMMENTS	`Essentially triangular numbers + 2, but with three extra initial terms.`
	LINKS	`Guo-Niu Han, Enumeration of Standard Puzzles`
	FORMULA	`For n>3, a(n) = (n^2-7n+16)/2 = A027689(n-4)/2 = A000217(n-4)+2 = A000124(n-4)+1 - Henry Bottomley (se16(AT)btinternet.com), Jun 27 2000`
	CROSSREFS	`Sequence in context: A004170 A028955 A104664 * A089071 A177205 A175829` `Adjacent sequences: A022853 A022854 A022855 * A022857 A022858 A022859`
	KEYWORD	`nonn,easy`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

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

Last modified February 4 10:57 EST 2012. Contains 204808 sequences.