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

A064669 Regard A064413 as giving a permutation of the positive integers; sequence gives (presumed) smallest term in each cycle of this permutation.

Original entry on oeis.org

1, 2, 3, 7, 8, 40, 64, 73, 101, 103, 121, 149, 223, 241, 251, 269, 331, 359, 383, 467, 499, 503, 509, 617, 673, 739, 773, 797, 823, 829, 1031, 1213, 1279, 1307, 1381, 1487, 1489, 1543, 1583, 1621, 1667, 1721, 1741, 1753, 1777, 1831, 1873, 1879
Offset: 1

Views

Author

N. J. A. Sloane, Oct 11 2001

Keywords

Examples

			Permutation has cycles (1) (2) (3, 4, 6, 9, 10, 5) ( ..., 20, 18, 12, 7, 14, 13, 28, 26, ...) (8) ...

Links

Crossrefs

Cf. A064413, A064665-A064668, A064793, A064794.

A065791 a(1) = 81; for n > 1, a(n) is the smallest square > a(n-1) with a(n-1) forming its final digits.

Original entry on oeis.org

81, 1681, 1461681, 220861461681, 31071113326220861461681, 36510705834446371569631071113326220861461681, 268496773864458678522722709023395604054900436510705834446371569631071113326220861461681
Offset: 1

Views

Author

Klaus Brockhaus, Nov 19 2001

Keywords

Comments

a(n) = A050634(n+1) for n >= 1.

Crossrefs

Cf. A050634, A065689, A065792, A064793.

A064794 Minimal representatives for the finite cycles in the permutation defined by A064413.

Original entry on oeis.org

1, 2, 3, 8, 40, 64, 121, 149, 359, 2879, 5563, 28571, 251677
Offset: 1

Views

Author

N. J. A. Sloane, Oct 21 2001

Keywords

Crossrefs

See A064793 for the cycle lengths. Cf. A064413, A064669.
Showing 1-3 of 3 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.