login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110515 Sequence array for (1 - x + x^2 + x^3)/(1 - x^4). 3
1, -1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1, 1, -1, 1, -1, 1, 1, 1, -1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1, 1, -1, 1, 1, 1, -1, 1, -1, 1, 1, 1, -1, 1, 1, 1, -1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1, -1, 1, -1, 1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1, -1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Row sums are A106249. Diagonal sums are A110514.
LINKS
FORMULA
Riordan array ((1 - x + x^2 + x^3)/(1 - x^4), 1).
Column k has g.f. x^k*(1 - x + x^2 + x^3)/(1 - x^4).
T(n, k) = if(k <= n, -sin(Pi*(n-k)/2) + cos(Pi*(n-k))/2 + 1/2, 0).
T(n, k) = if(k <= n, Jacobi(2^(n-k), 2(n-k)+1), 0) [conjecture].
EXAMPLE
Rows begin
1;
-1, 1;
1, -1, 1;
1, 1, -1, 1;
1, 1, 1, -1, 1;
-1, 1, 1, 1, -1, 1;
1, -1, 1, 1, 1,- 1, 1;
MATHEMATICA
Table[If[k <= n, -Sin[Pi*(n - k)/2] + Cos[Pi*(n - k)]/2 + 1/2, 0], {n, 0, 10}, {k, 0, n}]//Flatten (* G. C. Greubel, Aug 29 2017 *)
PROG
(PARI) for(n=0, 20, for(k=0, n, print1(round(if(k<=n, -sin(Pi*(n-k)/2) + cos(Pi*(n-k))/2 + 1/2, 0)), ", "))) \\ G. C. Greubel, Aug 29 2017
CROSSREFS
Sequence in context: A071935 A096809 A131561 * A355437 A071936 A005088
KEYWORD
easy,sign,tabl
AUTHOR
Paul Barry, Jul 24 2005
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 09:28 EDT 2024. Contains 371967 sequences. (Running on oeis4.)