login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118231 Triangle, read by rows, equal to the matrix square of triangle A118229. 2
1, -2, 1, -2, 0, 1, 4, -2, -2, 1, -2, 0, 0, 0, 1, 2, 1, 1, -2, -2, 1, 4, 0, -2, 0, -2, 0, 1, -6, 1, 6, -2, 1, 0, -2, 1, -4, 0, 1, 0, 3, 0, -2, 0, 1, 6, -1, -6, 4, -1, -2, 4, -2, -2, 1, -4, 0, 3, 0, 1, 0, -2, 0, 0, 0, 1, 4, 0, -3, -1, -1, 1, 2, 1, 1, -2, -2, 1, 14, 0, -7, 0, -7, 0, 6, 0, -2, 0, -2, 0, 1, -14, 0, 3, 1, 10, 0, -4, -2, 3, 0, 1, 0, -2, 1 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Describes the sequence transformation of triangle A118229 iterated twice. Also equals the matrix inverse of triangle A118233.

EXAMPLE

Triangle begins:

1;

-2, 1;

-2, 0, 1;

4,-2,-2, 1;

-2, 0, 0, 0, 1;

2, 1, 1,-2,-2, 1;

4, 0,-2, 0,-2, 0, 1;

-6, 1, 6,-2, 1, 0,-2, 1;

-4, 0, 1, 0, 3, 0,-2, 0, 1;

6,-1,-6, 4,-1,-2, 4,-2,-2, 1;

-4, 0, 3, 0, 1, 0,-2, 0, 0, 0, 1;

4, 0,-3,-1,-1, 1, 2, 1, 1,-2,-2, 1;

14, 0,-7, 0,-7, 0, 6, 0,-2, 0,-2, 0, 1; ...

PROG

(PARI) T(n, k)=if(n<k|k<0, 0, (matrix(n, n, r, c, if(r>=c, if(gcd(r-c+1, c)==1, 1, 0)))^-2)[n, k])

CROSSREFS

Cf. A118229, A118233 (inverse).

Sequence in context: A156837 A129559 A129680 * A166453 A118233 A181117

Adjacent sequences:  A118228 A118229 A118230 * A118232 A118233 A118234

KEYWORD

sign,tabl

AUTHOR

Leroy Quet, Paul D. Hanna (pauldhanna(AT)juno.com), Apr 16 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 03:44 EST 2012. Contains 205860 sequences.