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

A329763 a(n) = A329762(n+1)/A329762(n).

Original entry on oeis.org

5, 7, 5, 41, 25, 97, 2977, 64001, 28094849, 852235297, 702374178881
Offset: 1

Views

Author

Chai Wah Wu, Dec 04 2019

Keywords

Crossrefs

Cf. A329762, A078223, A078224.

A329764 a(1) = 1; thereafter a(n+1) > a(n) is the smallest multiple of a(n) using only odd digits but not divisible by 9.

Original entry on oeis.org

1, 3, 15, 75, 375, 9375, 159375, 71559375, 1195399359375, 353915911333359375, 51915571117579153359375, 753315397517553377717399173359375, 3319771735775931191533111595353537393933359375
Offset: 1

Views

Author

Chai Wah Wu, Dec 04 2019

Keywords

Comments

Equivalently, the sequence is defined as a(1) = 1, a(2) = 3, a(3) = 15, and for n > 2, a(n+1) > a(n) is the smallest multiple of a(n) using only odd digits. All terms besides a(1) and a(2) are divisible by 5.

Crossrefs

Cf. A329762, A078221, A078223.
Showing 1-2 of 2 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.