|
| |
|
|
A082507
|
|
Generated by a 3rd-order formal recursion with suitable initial values as follows: a[n]=n-a[n-1]-a[n-2]-a[n-3]; a[0]=a[1]=a[2]=0.
|
|
0
| |
|
|
2, 0, 0, 0, 3, 1, 1, 1, 4, 2, 2, 2, 5, 3, 3, 3, 6, 4, 4, 4, 7, 5, 5, 5, 8, 6, 6, 6, 9, 7, 7, 7, 10, 8, 8, 8, 11, 9, 9, 9, 12, 10, 10, 10
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| -1,1
|
|
|
FORMULA
| O.g.f.: 2/x+x^3(3-2x)/((1-x)^2*(1+x)(1+x^2)). a(n) = 3/8 -5*(-1)^n/8 +n/4 +(1/4)*cos(Pi*n/2) -(5/4)*sin(Pi*n/2), n>-1. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 22 2008]
a(n)=(3/8)+(1/8)*(1+5*I)*I^n-(5/8)*(-1)^n+(1/4)*n+(1/8)*(1-5*I)*(-I)^n, with n>=-1 [From Paolo P. Lava (paoloplava(AT)gmail.com), Jul 09 2010]
|
|
|
EXAMPLE
| Sum of 4 successive terms gives n for n>2:
n=2=a(-1)+a(0)+a(1)+a(2)=2+0+0+0;
n=3=a(3)=a(0)+a(1)+a(2)+a(3)=0+0+0+3;
n=4=a(1)+a(2)+a(3)+a(4)=0+0+3+1;
Value of a(-1)=2 is arbitrary but provide suitable extension.
|
|
|
MATHEMATICA
| f[x_] := x-f[x-1]-f[x-2]-f[x-3]; {f[0]=0, f[1]=0, f[2]=0}; Table[f[w], {w, 1, 25}]
|
|
|
CROSSREFS
| Cf. A063942, A028242, A001057.
Sequence in context: A046268 A202425 A113503 * A132349 A123391 A171871
Adjacent sequences: A082504 A082505 A082506 * A082508 A082509 A082510
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Apr 28 2003
|
| |
|
|
