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!)
A026587 a(n)=T(n,n-2), T given by A026584. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=2. 0
1, 1, 5, 9, 28, 62, 167, 399, 1024, 2518, 6359, 15819, 39759, 99427, 249699, 626203, 1573524, 3953446, 9943905, 25019005, 62994733, 158680545, 399936573, 1008438757, 2543992514, 6420413940, 16210331727, 40943722115, 103453402718 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,3

LINKS

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

FORMULA

Conjecture: (n+2)*a(n) +(-3*n-2)*a(n-1) +(-3*n-2)*a(n-2) +(11*n-16)*a(n-3) +2*(n-3)*a(n-4) +4*(-2*n+9)*a(n-5)=0. - R. J. Mathar, Jun 23 2013

CROSSREFS

Sequence in context: A272315 A301747 A193316 * A147367 A147230 A192914

Adjacent sequences:  A026584 A026585 A026586 * A026588 A026589 A026590

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 June 5 09:13 EDT 2020. Contains 334829 sequences. (Running on oeis4.)