A052344 - OEIS

This site is supported by donations to The OEIS Foundation.

A052344

Number of ways to write n as the unordered sum of two nonzero triangular numbers.

0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 2, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 2, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 2, 1, 0, 0, 2, 0, 1, 1, 0, 2, 0, 0, 0, 1, 2, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 2, 1, 0, 0, 2, 0, 0, 1, 0, 3, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 2, 0, 0, 1, 0, 1, 1, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,17`
	LINKS	`T. D. Noe, Table of n, a(n) for n = 0..10000`
	MATHEMATICA	`nn=150; tri=Accumulate[Range[nn]]; t=Table[0, {tri[[-1]]}]; Do[n=tri[[i]]+tri[[j]]; If[n <= tri[[-1]], t[[n]]++], {i, nn}, {j, i}]; t=Prepend[t, 0]`
	CROSSREFS	`Cf. A000217, A052343-A052348, A053587, A056303, A056304.` `Sequence in context: A097304 A136745 A090465 * A147768 A167746 A050370` `Adjacent sequences: A052341 A052342 A052343 * A052345 A052346 A052347`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net), Jan 23 2000`

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

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