login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026589 a(n)=T(n,n-4), T given by A026584. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=4. 0
1, 2, 9, 22, 69, 178, 497, 1294, 3452, 8964, 23430, 60556, 156663, 403214, 1037191, 2660978, 6821200, 17459732, 44657246, 114117628, 291449047, 743904326, 1897956899, 4840429962, 12340947855, 31455453822, 80158533099 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,2

LINKS

Table of n, a(n) for n=4..30.

FORMULA

Conjecture: -(n+4)*(65*n-269)*a(n) +(-65*n^2+140*n+1933)*a(n-1) +(809*n^2-2431*n-4514)*a(n-2) +(-123*n^2+2496*n-205)*a(n-3) +2*(-726*n^2+3737*n-4395)*a(n-4) +8*(56*n-215)*(2*n-9)*a(n-5)=0. - R. J. Mathar, Jun 23 2013

CROSSREFS

Sequence in context: A086718 A023625 A166754 * A319792 A091002 A330419

Adjacent sequences:  A026586 A026587 A026588 * A026590 A026591 A026592

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 21:37 EDT 2020. Contains 334690 sequences. (Running on oeis4.)