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!)
A319665 Irregular triangle read by rows: T(n,k) = log_5(4*k + 1) mod 2^n, n >= 2, 0 <= k <= 2^(n-2) - 1. 1
0, 0, 1, 0, 1, 2, 3, 0, 1, 6, 7, 4, 5, 2, 3, 0, 1, 6, 15, 12, 13, 2, 11, 8, 9, 14, 7, 4, 5, 10, 3, 0, 1, 6, 15, 28, 13, 2, 27, 24, 25, 30, 7, 20, 5, 26, 19, 16, 17, 22, 31, 12, 29, 18, 11, 8, 9, 14, 23, 4, 21, 10, 3, 0, 1, 6, 47, 28, 45, 2, 59, 56, 25, 62, 7, 20, 5, 58, 19, 48, 49, 54, 31, 12, 29, 50, 43, 40, 9, 46, 55, 4, 53, 42, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,6

COMMENTS

The n-th row contains 2^(n-2) numbers. T(n,k) is the smallest e such that 5^e == 4*k + 1 (mod 2^n). This equation always has a solution in [0, 2^(n-2) - 1], so the n-th row is a permutation of 0, 1, 2, ..., 2^(n-2) - 1.

For e >= 4, the multiplicative order of a modulo 2^e equals to 2^(e-2) iff a == 3, 5 (mod 8); for e >= 5, the multiplicative order of a modulo 2^e equals to 2^(e-3) iff a == 7, 9 (mod 16); for e >= 6, the multiplicative order of a modulo 2^e equals to 2^(e-4) iff a == 15, 17 (mod 32), etc. From this we can see v(T(n,k), 2) = v(k, 2), where v(k, 2) = A007814(k) is the 2-adic valuation of k. Also, 4*k + 1 is a 2^v(k, 2)-th power residue but not a 2^(v(k, 2)+1)-th power residue modulo 2^i, i >= v(k, 2) + 3.

Define Chi(n,k) as: Chi(n,2*k) = 0 for all integers k, Chi(n,4*k+1) = exp(T(n,k)*Pi*i/2^(n-3)) for 0 <= k <= 2^(n-2) - 1 (i denotes the imaginary unit), Chi(n,4*k+3) = Chi(n,2^n-4*k-3) for 0 <= k <= 2^(n-2) - 1, Chi(n,2^n+k) = Chi(n,k) for all integers k, then Chi(n,k) forms a Dirichlet character modulo 2^n.

LINKS

Table of n, a(n) for n=2..96.

EXAMPLE

Table begins

0,

0, 1,

0, 1, 2, 3,

0, 1, 6, 7, 4, 5, 2, 3,

0, 1, 6, 15, 12, 13, 2, 11, 8, 9, 14, 7, 4, 5, 10, 3,

0, 1, 6, 15, 28, 13, 2, 27, 24, 25, 30, 7, 20, 5, 26, 19, 16, 17, 22, 31, 12, 29, 18, 11, 8, 9, 14, 23, 4, 21, 10, 3,

...

PROG

(PARI) T(n, k) = my(i=0); while(Mod(5, 2^n)^i!=4*k+1, i++); i

CROSSREFS

Cf. A007814, A319663.

Sequence in context: A163465 A360380 A263230 * A004443 A171616 A323883

Adjacent sequences: A319662 A319663 A319664 * A319666 A319667 A319668

KEYWORD

nonn,tabf

AUTHOR

Jianing Song, Sep 25 2018

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 March 23 17:52 EDT 2023. Contains 361449 sequences. (Running on oeis4.)