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.

Showing 1-8 of 8 results.

A138255 Smallest positive integer m such that n divides [2^m/m] (=A000799(m)).

Original entry on oeis.org

1, 1, 5, 4, 6, 5, 9, 8, 7, 6, 12, 15, 14, 9, 13, 8, 10, 7, 21, 28, 13, 24, 48, 15, 22, 14, 19, 9, 30, 13, 11, 8, 31, 10, 13, 21, 38, 21, 14, 39, 22, 13, 29, 63, 13, 67, 135, 65, 43, 22, 10, 15, 35, 19, 24, 9, 21, 30, 120, 28, 62, 11, 13, 16, 14, 31, 69, 20, 67, 13, 145, 21, 19, 38
Offset: 1

Views

Author

Max Alekseyev, Mar 09 2008

Keywords

Comments

This sequence is well-defined.

Links

Crossrefs

Cf. A000799, A138256, A138257, A138258, A138259, A138260, A138261, A138262, A138263.

Programs

  • Maple
    f:= proc(n) local m;
     for m from 1 do if floor(2^m/m) mod n = 0 then return m fi od
end proc:
map(f, [$1..100]); # Robert Israel, Jun 07 2018
  • Mathematica
    a[n_] := For[m = 1, True, m++, If[Divisible[Floor[2^m/m], n], Return[m]]];
Array[a, 100] (* Jean-François Alcover, Mar 22 2019 *)
  • Python
    from itertools import count
def A138255(n): return next(m for m in count(1) if not (1<Chai Wah Wu, Aug 24 2023

A138260 Smallest positive integer m such that n divides [7^m/m] (=A129797(m)).

Original entry on oeis.org

1, 2, 2, 2, 4, 2, 1, 2, 13, 4, 20, 2, 12, 11, 4, 11, 16, 13, 3, 4, 11, 20, 67, 2, 4, 12, 19, 11, 43, 4, 60, 13, 20, 16, 13, 13, 9, 3, 12, 4, 10, 11, 6, 20, 13, 67, 66, 11, 7, 4, 16, 12, 79, 19, 20, 11, 3, 43, 78, 4, 51, 60, 13, 17, 12, 20, 75, 16, 67, 13, 52, 13, 24, 9, 4, 6, 31, 12, 35
Offset: 1

Views

Author

Max Alekseyev, Mar 09 2008

Keywords

Comments

This sequence is well-defined.

Links

Crossrefs

Cf. A129797, A138255, A138256, A138257, A138258, A138259, A138261, A138262, A138263.

Programs

  • Mathematica
    spi[n_]:=Module[{m=1},While[Mod[Floor[7^m/m],n]!=0,m++];m]; Array[spi,80] (* Harvey P. Dale, Aug 16 2018 *)

A138256 Smallest positive integer m such that n divides [3^m/m] (=A092763(m)).

Original entry on oeis.org

1, 2, 1, 2, 4, 5, 13, 5, 3, 4, 6, 5, 7, 13, 13, 5, 16, 10, 15, 4, 13, 11, 15, 5, 22, 7, 9, 13, 30, 13, 33, 17, 11, 16, 13, 10, 19, 37, 7, 13, 8, 13, 55, 11, 14, 67, 35, 5, 43, 22, 82, 7, 108, 92, 20, 13, 37, 30, 120, 13, 11, 33, 26, 17, 14, 11, 23, 16, 24, 13, 72, 10, 13, 19, 22, 37
Offset: 1

Views

Author

Max Alekseyev, Mar 09 2008

Keywords

Comments

This sequence is well-defined.

Links

  • Romanian Master in Mathematics Contest, Bucharest, 2007, Problem 3

Crossrefs

Cf. A092763, A138255, A138257, A138258, A138259, A138260, A138261, A138262, A138263.

Programs

  • Mathematica
    pim[n_]:=Module[{m=1},While[!Divisible[Floor[3^m/m],n],m++];m]; Array[pim, 80] (* Harvey P. Dale, Oct 26 2011 *)

A138257 Smallest positive integer m such that n divides [4^m/m] (=A129794(m)).

Original entry on oeis.org

1, 1, 3, 1, 7, 5, 3, 2, 7, 7, 6, 5, 7, 13, 7, 4, 5, 7, 9, 7, 3, 6, 10, 22, 11, 7, 19, 13, 15, 7, 6, 4, 31, 5, 13, 7, 19, 20, 7, 22, 11, 13, 15, 31, 7, 24, 10, 69, 43, 11, 5, 7, 44, 19, 31, 26, 9, 15, 42, 7, 31, 6, 13, 4, 7, 31, 69, 5, 67, 13, 124, 26, 9, 19, 11, 20, 31, 7, 18, 69, 28, 11, 126
Offset: 1

Views

Author

Max Alekseyev, Mar 09 2008

Keywords

Comments

This sequence is well-defined.

Links

  • Romanian Master in Mathematics Contest, Problem 3, Bucharest, 2007.

Crossrefs

Cf. A129794, A138255, A138256, A138258, A138259, A138260, A138261, A138262, A138263.

Programs

  • Mathematica
    spi[n_]:=Module[{m=1},While[!Divisible[Floor[4^m/m],n],m++];m]; Array[ spi,90] (* Harvey P. Dale, Sep 13 2020 *)

A138259 Smallest positive integer m such that n divides [6^m/m] (=A129796(m)).

Original entry on oeis.org

1, 1, 1, 3, 5, 1, 11, 3, 2, 7, 21, 3, 20, 11, 7, 6, 40, 2, 10, 219, 11, 21, 20, 3, 11, 20, 4, 119, 15, 7, 7, 6, 31, 40, 11, 3, 13, 37, 33, 219, 42, 11, 7, 130, 38, 20, 33, 6, 15, 11, 57, 20, 79, 4, 21, 119, 10, 15, 60, 219, 62, 7, 38, 9, 37, 31, 50, 259, 49, 11, 211, 3, 37, 13, 11, 219
Offset: 1

Views

Author

Max Alekseyev, Mar 09 2008

Keywords

Comments

This sequence is well-defined.

Links

  • Romanian Master in Mathematics Contest, Problem 3, Bucharest, 2007.

Crossrefs

Cf. A129796, A138255, A138256, A138257, A138258, A138260, A138261, A138262, A138263.

Programs

  • Mathematica
    a[n_]:=Module[{m=1},While[!Divisible[Floor[6^m/m],n],m++];m];Array[a,76] (* James C. McMahon, Jun 05 2025 *)

A138261 Smallest positive integer m such that n divides [8^m/m] (=A129798(m)).

Original entry on oeis.org

1, 1, 10, 1, 3, 10, 7, 1, 11, 3, 21, 11, 9, 9, 13, 2, 3, 11, 13, 9, 11, 21, 15, 11, 21, 9, 13, 9, 10, 13, 11, 2, 21, 3, 9, 11, 13, 13, 17, 9, 21, 11, 10, 21, 13, 15, 92, 55, 29, 21, 20, 9, 58, 13, 21, 9, 13, 10, 22, 13, 21, 11, 11, 4, 9, 21, 23, 9, 67, 9, 46, 11, 13, 13, 21, 13, 31, 17
Offset: 1

Views

Author

Max Alekseyev, Mar 09 2008

Keywords

Comments

This sequence is well-defined.

Links

  • Romanian Master in Mathematics Contest, Problem 3, Bucharest, 2007.

Crossrefs

Cf. A129798, A138255, A138256, A138257, A138258, A138259, A138260, A138262, A138263.

Programs

  • Mathematica
    spi[n_]:=Module[{m=1},While[!Divisible[Floor[8^m/m],n],m++];m]; Array[spi,80] (* Harvey P. Dale, Oct 23 2022 *)

Formula

If A138255(n) is divisible by 3 then a(n)=A138255(n)/3. In general, a(n) >= A138255(n)/3.

A138262 Smallest positive integer m such that n divides [9^m/m] (=A129799(m)).

Original entry on oeis.org

1, 2, 1, 2, 2, 11, 5, 2, 1, 2, 10, 11, 19, 13, 11, 11, 7, 11, 28, 2, 13, 10, 6, 11, 11, 19, 3, 13, 15, 11, 61, 13, 11, 8, 13, 11, 19, 28, 19, 2, 4, 13, 60, 10, 11, 12, 24, 11, 5, 11, 41, 19, 79, 82, 10, 13, 28, 15, 233, 11, 10, 61, 13, 17, 19, 11, 12, 8, 12, 13, 36, 11, 13, 19, 11, 37
Offset: 1

Views

Author

Max Alekseyev, Mar 09 2008

Keywords

Comments

This sequence is well-defined.

Links

  • Romanian Master in Mathematics Contest, Problem 3, Bucharest, 2007.

Crossrefs

Cf. A129799, A138255, A138256, A138257, A138258, A138259, A138260, A138261, A138263.

Programs

  • Mathematica
    spi[n_]:=Module[{m=1},While[Mod[Floor[9^m/m],n]!=0,m++];m]; Array[spi,80] (* Harvey P. Dale, Jul 07 2022 *)

A138263 Smallest positive integer m such that n divides [10^m/m] (=A060156(m)).

Original entry on oeis.org

1, 1, 3, 4, 1, 11, 13, 5, 3, 1, 13, 52, 19, 13, 11, 5, 24, 11, 37, 4, 13, 13, 45, 84, 2, 19, 13, 34, 94, 11, 12, 5, 13, 24, 13, 92, 3, 37, 19, 5, 11, 13, 96, 238, 11, 45, 51, 84, 43, 2, 33, 272, 76, 13, 13, 34, 37, 95, 36, 164, 181, 24, 13, 10, 19, 13, 39, 46, 67, 13, 82, 92, 17
Offset: 1

Views

Author

Max Alekseyev, Mar 09 2008

Keywords

Comments

This sequence is well-defined.

Links

  • Romanian Master in Mathematics Contest, Problem 3, Bucharest, 2007.

Crossrefs

Cf. A060156, A138255, A138256, A138257, A138258, A138259, A138260, A138261, A138262.
Showing 1-8 of 8 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.