Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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!)
A177207 Triangle read by rows: R(n,k) = 2^(n-k) mod n. 0
0, 0, 1, 1, 2, 1, 0, 0, 2, 1, 1, 3, 4, 2, 1, 2, 4, 2, 4, 2, 1, 1, 4, 2, 1, 4, 2, 1, 0, 0, 0, 0, 0, 4, 2, 1, 4, 2, 1, 5, 7, 8, 4, 2, 1, 2, 6, 8, 4, 2, 6, 8, 4, 2, 1, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 2, 1, 1, 7, 10, 5, 9, 11, 12, 6, 3, 8, 4, 2, 1, 2, 8, 4, 2, 8, 4, 2, 8, 4, 2, 8, 4, 2, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
EXAMPLE
Triangle begins:
0;
0, 1;
1, 2, 1;
0, 0, 2, 1;
1, 3, 4, 2, 1;
2, 4, 2, 4, 2, 1;
MATHEMATICA
Array[PowerMod[2, # - Range[#], #] &, 15] (* Paolo Xausa, Jun 28 2024 *)
PROG
(PARI) row(n) = vector(n, k, lift(Mod(2, n)^(n-k))); \\ Michel Marcus, Jun 27 2024
CROSSREFS
Cf. A062173 (1st column).
Sequence in context: A125070 A125071 A335699 * A161528 A175083 A323090
KEYWORD
nonn,tabl
AUTHOR
EXTENSIONS
Corrected by D. S. McNeil, Dec 10 2010
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 August 6 00:03 EDT 2024. Contains 374957 sequences. (Running on oeis4.)