A026573 - OEIS

This site is supported by donations to The OEIS Foundation.

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Other ways to donate

A026573

a(n)=T(n,n-4), T given by A026568. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=4.

1, 3, 12, 34, 103, 281, 778, 2072, 5524, 14488, 37918, 98474, 255137, 658351, 1695542, 4356520, 11177720, 28637452, 73294698, 187412326, 478861373, 1222765699, 3120722598, 7961152560, 20302100415, 51757554237 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`4,2`
	LINKS	`Table of n, a(n) for n=4..29.`
	FORMULA	`Conjecture: -2(n-4)(n+4)a(n) +(5n^2-5n-46)a(n-1) +(4n^2+n+18)a(n-2) +(-11n^2+24n-16)a(n-3) +2(n-2)(2n-5)*a(n-4)=0. - R. J. Mathar, Jun 23 2013`
	CROSSREFS	`Sequence in context: A060298 A226546 A073372 * A225075 A293267 A097339` `Adjacent sequences: A026570 A026571 A026572 * A026574 A026575 A026576`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy .

Last modified November 15 13:15 EST 2017. Contains 294720 sequences.