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.

A343538 Longest sequence of distinct two-digit numbers (10-99) such that any two or three consecutive terms can be concatenated into a prime number, even when connected into a loop. Smallest number is listed first.

Original entry on oeis.org

13, 61, 63, 67, 19, 99, 31, 69, 91, 87, 79, 37, 39, 43, 27, 49, 73, 51
Offset: 1

Views

Author

Andreas Boe, Apr 18 2021

Keywords

Comments

A total of 164 sequences exist from two to eighteen terms. Checked to a depth of 50 terms with two different programs. 11262 sequences with two to twenty-one terms exist if the demand on connecting the sequence into a loop is removed.

Examples

			13,61,63,67 -> 1361, 6163, 6367, 136163, 616367 are all prime numbers.
		

References

  • Andreas Boe, The Toy Robot, Amazon, 2014, Afterword Quiz.