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

A165049 Smallest member of cycle corresponding to n-th term of A165048.

Original entry on oeis.org

0, 8, 48, 392, 1992, 7488, 53712, 249992, 1831056, 6249992, 45781056, 48217776, 170312312, 1144531056, 1205467776, 1217651376, 4576557032, 4514058432, 28613281056, 28671874056, 22460937432, 30136717776, 30441401376
Offset: 1

Views

Author

Joseph Myers, Sep 04 2009

Keywords

Comments

Initial terms in base 5: 0, 13, 143, 3032, 30432, 214423, 3204322, 30444432, 432043211, 3044444432.

Links

Crossrefs

Cf. A165032, A165037, A165048, A165050.
In other bases: A163205 (base 2), A165010 (base 3), A165030 (base 4), A165069 (base 6), A165088 (base 7), A165108 (base 8), A165128 (base 9), A151965 (base 10).

A165050 Length of cycle corresponding to n-th term of A165048.

Original entry on oeis.org

1, 1, 2, 1, 4, 5, 4, 6, 1, 4, 3, 1, 8, 5, 3, 1, 4, 5, 6, 2, 4, 5, 3, 1, 4, 1, 5, 4, 4, 2, 2, 2, 6, 5, 3, 1, 5, 1, 4, 4, 4, 4, 3, 2, 4, 4, 2, 6, 5, 2, 3, 1, 3, 1, 9, 3, 9, 4, 4, 4, 2, 4, 4, 4, 2, 6, 5, 2, 3, 1, 5, 5, 3, 1, 6, 3, 2, 6, 6, 3, 9, 1, 9, 4, 4, 3, 4, 2, 4, 4, 4, 2, 6, 5, 2, 3, 1, 11, 5, 3, 1, 11, 11
Offset: 1

Views

Author

Joseph Myers, Sep 04 2009

Keywords

Links

Crossrefs

Cf. A165032, A165037, A165048, A165049.
In other bases: A000012 (base 2), A165011 (base 3), A165031 (base 4), A165070 (base 6), A165089 (base 7), A165109 (base 8), A165129 (base 9), A151966 (base 10).

A165038 Length of cycle mentioned in A165037.

Original entry on oeis.org

1, 1, 2, 2, 1, 4, 4, 4, 4, 5, 5, 5, 5, 5, 4, 4, 4, 4, 6, 6, 6, 6, 6, 6, 1, 4, 4, 4, 4, 3, 3, 3, 1, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 3, 3, 3, 1, 5, 5, 4, 5, 5, 4, 4, 5, 4, 4, 4, 6, 2, 6, 6, 4, 4, 6, 6, 2, 6, 5, 5, 5, 5, 5, 3, 3, 3, 1, 5, 4, 4, 5, 5, 5, 5, 4, 4, 1, 4, 2, 2, 4, 4, 4, 4, 2, 2, 4, 4, 4, 6, 2, 6
Offset: 1

Views

Author

Joseph Myers, Sep 04 2009

Keywords

Links

Crossrefs

Cf. A165032, A165037, A165040, A165042, A165044, A165050.
In other bases: A000012 (base 2), A164999 (base 3), A165018 (base 4), A165057 (base 6), A165077 (base 7), A165096 (base 8), A165116 (base 9), A164717 (base 10).

A165040 Length of cycle mentioned in A165039.

Original entry on oeis.org

2, 2, 4, 4, 4, 4, 5, 5, 5, 5, 5, 4, 4, 4, 4, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 3, 3, 3, 5, 5, 4, 5, 5, 4, 4, 5, 4, 4, 4, 6, 2, 6, 6, 4, 4, 6, 6, 2, 6, 5, 5, 5, 5, 5, 3, 3, 3, 5, 4, 4, 5, 5, 5, 5, 4, 4, 4, 2, 2, 4, 4, 4, 4, 2, 2, 4, 4, 4, 6, 2, 6, 6, 6, 6, 2, 6, 5, 5, 5
Offset: 1

Views

Author

Joseph Myers, Sep 04 2009

Keywords

Links

Crossrefs

Cf. A165032, A165039, A165038, A165042, A165044, A165050.
In other bases: Empty (base 2), A165001 (base 3), A165020 (base 4), A165059 (base 6), A165079 (base 7), A165098 (base 8), A165118 (base 9), A164715 (base 10).

A165042 Length of cycle mentioned in A165041.

Original entry on oeis.org

1, 1, 2, 1, 4, 5, 4, 6, 1, 4, 3, 1, 8, 5, 3, 1, 5, 4, 4, 6, 2, 5, 3, 1, 5, 4, 1, 4, 2, 2, 4, 6, 2, 5, 3, 1, 5, 1, 3, 4, 4, 4, 4, 4, 2, 2, 4, 6, 2, 5, 3, 1, 3, 1, 9, 9, 3, 4, 4, 4, 4, 4, 2, 2, 4, 6, 2, 5, 3, 1, 5, 5, 3, 1, 6, 6, 2, 6, 3, 3, 1, 9, 9, 3, 4, 4, 4, 4, 4, 2, 2, 4, 6, 2, 5, 3, 1, 11, 5, 3, 1, 11, 11
Offset: 1

Views

Author

Joseph Myers, Sep 04 2009

Keywords

Links

Crossrefs

Cf. A165032, A165041, A165038, A165040, A165044, A165050.
In other bases: A000012 (base 2), A165003 (base 3), A165022 (base 4), A165061 (base 6), A165081 (base 7), A165100 (base 8), A165120 (base 9), A164719 (base 10).

A165044 Length of cycle mentioned in A165043.

Original entry on oeis.org

2, 4, 5, 4, 6, 4, 3, 8, 5, 3, 5, 4, 4, 6, 2, 5, 3, 5, 4, 4, 2, 2, 4, 6, 2, 5, 3, 5, 3, 4, 4, 4, 4, 4, 2, 2, 4, 6, 2, 5, 3, 3, 9, 9, 3, 4, 4, 4, 4, 4, 2, 2, 4, 6, 2, 5, 3, 5, 5, 3, 6, 6, 2, 6, 3, 3, 9, 9, 3, 4, 4, 4, 4, 4, 2, 2, 4, 6, 2, 5, 3, 11, 5, 3, 11, 11, 11, 6, 6, 2, 6, 3, 3, 9, 9, 3, 4, 4, 4, 4, 4, 2, 2
Offset: 1

Views

Author

Joseph Myers, Sep 04 2009

Keywords

Links

Crossrefs

Cf. A165032, A165043, A165038, A165040, A165042, A165050.
In other bases: Empty (base 2), A165005 (base 3), A165024 (base 4), A165063 (base 6), A165083 (base 7), A165102 (base 8), A165122 (base 9), A164721 (base 10).

A319722 Write n in 5-ary, sort digits into decreasing order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 11, 16, 21, 10, 11, 12, 17, 22, 15, 16, 17, 18, 23, 20, 21, 22, 23, 24, 25, 30, 55, 80, 105, 30, 31, 56, 81, 106, 55, 56, 61, 86, 111, 80, 81, 86, 91, 116, 105, 106, 111, 116, 121, 50, 55, 60, 85, 110, 55, 56, 61, 86, 111, 60, 61, 62, 87, 112, 85
Offset: 0

Views

Author

Seiichi Manyama, Sep 26 2018

Keywords

Links

Crossrefs

b-ary: A073138 (b=2), A319651 (b=3), A319720 (b=4), this sequence (b=5), A319723 (b=6), A319724 (b=7), A319725 (b=8), A319726 (b=9), A004186 (b=10).
Cf. A165032, A319653.

Programs

  • Mathematica
    Table[FromDigits[ReverseSort[IntegerDigits[n, 5]], 5], {n, 0, 100}] (* Paolo Xausa, Aug 07 2024 *)
  • PARI
    a(n) = fromdigits(vecsort(digits(n, 5), , 4), 5); \\ Michel Marcus, Sep 26 2018
  • Ruby
    def A(k, n)
  (0..n).map{|i| i.to_s(k).split('').sort.reverse.join.to_i(k)}
end
p A(5, 100)

Formula

n <= a(n) < 5n. - Charles R Greathouse IV, Aug 07 2024

A008617 Expansion of 1/((1-x^2)(1-x^7)).

Original entry on oeis.org

1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 5, 6, 5, 6, 5, 6, 6
Offset: 0

Views

Author

N. J. A. Sloane

Keywords

Comments

a(n) is the number of (n+9)-digit fixed points under the base-5 Kaprekar map A165032 (see A165036 for the list of fixed points). - Joseph Myers, Sep 04 2009
It appears that this is the number of partitions of 4*n that are 8-term arithmetic progressions. Further, it seems that a(n)=[n/2]-[3n/7]. - John W. Layman, Feb 21 2012

References

  • D. J. Benson, Polynomial Invariants of Finite Groups, Cambridge, 1993, p. 100.

Links

Programs

  • Mathematica
    CoefficientList[Series[1 / ((1 - x^2) (1 - x^7)), {x, 0, 100}], x] (* Vincenzo Librandi, Jun 22 2013 *)
LinearRecurrence[{0,1,0,0,0,0,1,0,-1},{1,0,1,0,1,0,1,1,1},80] (* Harvey P. Dale, May 18 2018 *)

Formula

a(n) = floor((2*n+21+7*(-1)^n)/28). - Tani Akinari, May 19 2014

Extensions

Typo in name fixed by Vincenzo Librandi, Jun 22 2013

A319653 Write n in 5-ary, sort digits into increasing order.

Original entry on oeis.org

0, 1, 2, 3, 4, 1, 6, 7, 8, 9, 2, 7, 12, 13, 14, 3, 8, 13, 18, 19, 4, 9, 14, 19, 24, 1, 6, 7, 8, 9, 6, 31, 32, 33, 34, 7, 32, 37, 38, 39, 8, 33, 38, 43, 44, 9, 34, 39, 44, 49, 2, 7, 12, 13, 14, 7, 32, 37, 38, 39, 12, 37, 62, 63, 64, 13, 38, 63, 68, 69, 14, 39, 64, 69, 74, 3
Offset: 0

Views

Author

Seiichi Manyama, Sep 25 2018

Keywords

Links

Crossrefs

b-ary: A038573 (b=2), A038574 (b=3), A319652 (b=4), this sequence (b=5), A319654 (b=6), A319655 (b=7), A319656 (b=8), A319657 (b=9), A004185 (b=10).
Cf. A165032, A319722.

Programs

  • Mathematica
    Table[FromDigits[Sort[IntegerDigits[n,5]],5],{n,0,100}] (* Harvey P. Dale, Feb 29 2024 *)
  • PARI
    a(n) = fromdigits(vecsort(digits(n, 5)), 5); \\ Michel Marcus, Sep 25 2018
  • Ruby
    def A(k, n)
  (0..n).map{|i| i.to_s(k).split('').sort.join.to_i(k)}
end
p A(5, 100)
Previous Showing 21-29 of 29 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.