cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 21-22 of 22 results.

A245805 a(n) = 12^n mod 11^n.

Original entry on oeis.org

0, 1, 23, 397, 6095, 87781, 1214423, 16344637, 1263934, 443884970, 10042515022, 172385029466, 2639243694814, 3425068947279, 144668963799141, 2875277066339415, 1085339440747772, 196822992743261908, 4383664026916317980, 13684547128550195393, 470010017784675076171
Offset: 0

Views

Author

Vincenzo Librandi, Aug 04 2014

Keywords

Crossrefs

Cf. k^n mod (k-1)^n: A002380 (k=3), A064629 (k=4), A138589 (k=5), A138649 (k=6), A139786 (k=7), A138973 (k=8), A139733 (k=9), A016189 (k=10), A016195 (k=11), this sequence (k=12),

Programs

  • Magma
    [12^n mod 11^n: n in [0..25]];
    
  • Mathematica
    Table[PowerMod[12, n, 11^n], {n, 0, 30}]
  • PARI
    vector(50, n, 12^(n-1)%11^(n-1)) \\ Derek Orr, Aug 04 2014

A124402 Numbers k such that 3^k mod 2^k < 3^(k-1) mod 2^(k-1).

Original entry on oeis.org

4, 7, 17, 20, 24, 27, 29, 40, 45, 48, 49, 53, 55, 57, 61, 62, 65, 67, 72, 76, 79, 82, 83, 85, 88, 91, 95, 100, 101, 106, 107, 109, 112, 119, 124, 136, 139, 142, 149, 151, 153, 158, 159, 164, 165, 167, 171, 178, 186, 189, 193, 197, 198, 202, 204, 209, 210, 215, 219
Offset: 1

Views

Author

Robert G. Wilson v, Dec 14 2006

Keywords

Comments

Also indices k such that A002380(k) < A002380(k-1).

Examples

			1 == 3^4 (mod 2^4) which is less than 3 == 3^3 (mod 2^3) so 4 is a term.
		

Crossrefs

Cf. A002380.

Programs

  • Mathematica
    pm = 0; lst = {}; Do[pn = PowerMod[3, n, 2^n]; If[pn < pm, AppendTo[lst, n]]; pm = pn, {n, 221}]; lst
Previous Showing 21-22 of 22 results.