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 11-13 of 13 results.

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.

A078229 a(n) = A078226(n+1)/A078226(n).

Original entry on oeis.org

3, 3, 3, 3, 7, 15, 9, 129, 685, 6161, 610297, 273165705, 337025079889
Offset: 1

Views

Author

Amarnath Murthy, Nov 23 2002

Keywords

Crossrefs

Cf. A078221, A078222, A078223, A078224, A078225, A078226, A078227, A077228.

Extensions

More terms up to A078226(12)/A078226(11) Hagen von Eitzen, May 15 2009
a(12)-a(13) from Max Alekseyev, May 13 2010

A329765 a(n) = A329764(n+1)/A329764(n).

Original entry on oeis.org

3, 5, 5, 5, 25, 17, 449, 16705, 296065, 146689, 14510394113, 4406881562113
Offset: 1

Views

Author

Chai Wah Wu, Dec 04 2019

Keywords

Crossrefs

Cf. A329763, A329764, A078221, A078222, A078223, A078224.
Previous Showing 11-13 of 13 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.