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.

A341699 a(n) is the least m such that A341694(m, k) = n for some k > 0.

Original entry on oeis.org

1, 2, 2, 4, 2, 11, 4, 2, 5, 12, 4, 9, 2, 8, 17, 12, 5, 4, 24, 32, 2, 48, 8, 13, 10, 12, 19, 16, 4, 25, 5, 18, 21, 2, 33, 36, 8, 11, 34, 45, 37, 9, 68, 13, 16, 66, 4, 77, 10, 24, 27, 47, 17, 153, 2, 39, 5, 48, 95, 8, 22, 51, 18, 26, 21, 49, 71, 12, 44, 11, 36
Offset: 1

Views

Author

Rémy Sigrist, Feb 17 2021

Keywords

Examples

			The first row of A341694 contains only 1's:
- so a(1) = 1.
The second row of A341694 contains the positive Fibonacci numbers:
- so a(2) = a(3) = a(5) = a(8) = a(13) = a(21) = a(34) = a(55) = ..., = 2.
		

Crossrefs

Programs

  • PARI
    See Links section.

Formula

a(n) <= 2^(n-1).
A341285(n) = A070939(a(n)).