The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A117904 Number triangle [k<=n]*0^abs(L(C(n,2)/3) - L(C(k,2)/3)) where L(j/p) is the Legendre symbol of j and p. 5
1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Row sums are A009947(n+2).
Diagonal sums are A117905.
Inverse is A117906.
Equals A117898 mod 2.
LINKS
FORMULA
G.f.: (1 +x*(1+y) +x^2*y^2 +x^3*y)/((1-x^3)*(1-x^3*y^3)).
T(n, k) = [k<=n] * 2^abs(L(C(n,2)/3) - L(C(k,2)/3)) mod 2.
EXAMPLE
Triangle begins
1;
1, 1;
0, 0, 1;
1, 1, 0, 1;
1, 1, 0, 1, 1;
0, 0, 1, 0, 0, 1;
1, 1, 0, 1, 1, 0, 1;
1, 1, 0, 1, 1, 0, 1, 1;
0, 0, 1, 0, 0, 1, 0, 0, 1;
1, 1, 0, 1, 1, 0, 1, 1, 0, 1;
1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1;
MATHEMATICA
T[n_, k_]:= If[Abs[JacobiSymbol[Binomial[n, 2], 3] - JacobiSymbol[Binomial[k, 2], 3]]==0, 1, 0];
Table[T[n, k], {n, 0, 12}, {k, 0, n}]//Flatten (* G. C. Greubel, Oct 20 2021 *)
PROG
(Sage)
def A117904(n, k): return 1 if abs(jacobi_symbol(binomial(n, 2), 3) - jacobi_symbol(binomial(k, 2), 3))==0 else 0
flatten([[A117904(n, k) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, Oct 20 2021
CROSSREFS
Sequence in context: A115361 A115358 A325898 * A259030 A212412 A185906
KEYWORD
easy,nonn,tabl
AUTHOR
Paul Barry, Apr 01 2006
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 May 12 18:11 EDT 2024. Contains 372493 sequences. (Running on oeis4.)