id:A084841 - OEIS Search Results

Search: id:A084841

Displaying 1-1 of 1 results found.

page 1

Write the numbers 1, 2, ... in a triangle with n terms in the n-th row; a(n) = number of deficient integers in n-th row.

+0
2

1, 2, 2, 4, 4, 4, 5, 6, 7, 8, 8, 9, 9, 10, 11, 14, 13, 14, 15, 13, 16, 18, 17, 19, 18, 20, 19, 21, 23, 21, 23, 24, 24, 26, 26, 27, 29, 28, 29, 30, 31, 32, 31, 33, 36, 34, 36, 37, 35, 40, 37, 38, 40, 40, 42, 43, 43, 42, 44, 47, 45, 47, 46, 47, 50, 48, 53, 51, 53, 51, 53, 53, 58, 54 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`Triangle begins` `1 (1 deficient)` `2 3 (2 deficient)` `4 5 6 (2 deficient)` `7 8 9 10 (4 deficient)` `11 12 13 14 15 (4 deficient)` `16 17 18 19 20 21 (4 deficient)` `22 23 24 25 26 27 28 (5 deficient)`
	CROSSREFS	`Cf. A005100.` `Sequence in context: A090557 A035660 A115367 this_sequence A144202 A157887 A085237` `Adjacent sequences: A084838 A084839 A084840 this_sequence A084842 A084843 A084844`
	KEYWORD	`easy,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jun 08 2003`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research