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-23 of 23 results.

A128148 a(n) = least k such that 3^k mod k = 2^n.

Original entry on oeis.org

2, 2929, 41459, 2352527, 144937, 1055, 1829903, 7316185805, 114491, 3146746271, 5028467, 20299, 69609309001, 129433, 15307006153, 2149705, 66469, 559182815, 18429503, 4529951, 7094711, 83591212702535, 1251548749, 38088889
Offset: 0

Views

Author

Alexander Adamchuk, Feb 16 2007

Keywords

Examples

			a(1) = A128149(3) = 2929.
a(2) = A128150(3) = 41459.

Crossrefs

Cf. A078457 = least k such that the remainder when 3^k is divided by k is n.
Cf. A036236, A128149, A128150.

Formula

a(n) = A078457(2^n).

Extensions

a(7)-a(9) from A078457. Max Alekseyev, Mar 11 2009
Extended by Max Alekseyev, Mar 15 2009
a(20) from Hagen von Eitzen, Aug 01 2009
a(21)-a(23) from Max Alekseyev, Feb 13 2012

A177495 a(n) is the least k such that the remainder when 100^k is divided by k is n.

Original entry on oeis.org

3, 7, 97, 6, 19, 38, 31, 23, 13, 15, 89, 22, 29, 43, 17, 24, 83, 41, 19003, 580, 79, 42, 1903, 58, 35, 37, 73, 36, 71, 49, 999969, 56, 67, 66, 145, 76, 411, 578, 61, 60, 59, 494, 51, 262, 55, 158, 53, 52, 57, 398, 15673, 69, 1589, 9946, 65, 88, 20940211, 366, 391
Offset: 1

Views

Author

Alexander Adamchuk, May 10 2010

Keywords

Crossrefs

Cf. A036236, A078457, A119678, A119679, A127816, A119715, A119714, A127817, A127818, A127819, A127820, A127821, A128154, A128155, A128156, A128157, A128158, A128159, A128160, A128361, A128362, A128363, A128364, A128365, A128366, A128367, A128368, A128369, A128370, A128371, A128372.
Cf. A128149, A128150, A128172.

Programs

  • Mathematica
    t = Table[0, {70}]; k = 1; While[k < 210000000, a = PowerMod[100, k, k]; If[a < 71 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t
Table[Module[{k=1},While[PowerMod[100,k,k]!=n,k++];k],{n,60}] (* Harvey P. Dale, Jun 06 2018 *)

A177496 a(n) is the least k such that the remainder when 1000^k is divided by k is n.

Original entry on oeis.org

3, 62, 997, 6, 115, 7, 51, 14, 991, 11, 23, 13, 21, 17, 197, 24, 983, 158, 109, 35, 89, 42, 977, 61, 39, 34, 139, 36, 971, 38, 3291, 188, 967, 66, 193, 92, 57, 74, 999161, 52, 137, 479, 69, 239, 191, 53, 953, 49, 317, 70, 73, 79, 947, 65291, 63, 59, 448991, 114, 941
Offset: 1

Views

Author

Alexander Adamchuk, May 10 2010

Keywords

Crossrefs

Cf. A036236, A078457, A119678, A119679, A127816, A119715, A119714, A127817, A127818, A127819, A127820, A127821, A128154, A128155, A128156, A128157, A128158, A128159, A128160, A128361, A128362, A128363, A128364, A128365, A128366, A128367, A128368, A128369, A128370, A128371, A128372, A177495.
Cf. A128149, A128150, A128172.

Programs

  • Mathematica
    t = Table[0, {98}]; k = 1; While[k < 10000000, a = PowerMod[1000, k, k]; If[a < 99 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t
lk[n_]:=Module[{k=1},While[PowerMod[1000,k,k]!=n,k++];k]; Array[lk,60] (* Harvey P. Dale, Jul 21 2021 *)
Previous Showing 21-23 of 23 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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