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.

A334857 Lexicographically earliest sequence of integers > 1 such that for any distinct m and n, a(m)^a(m+1) <> a(n)^a(n+1).

This page as a plain text file.
%I A334857 #11 May 17 2020 06:21:29
%S A334857 2,2,3,2,4,3,3,4,4,5,2,5,3,5,4,6,2,7,2,9,3,7,3,8,5,5,6,3,9,5,7,4,7,5,
%T A334857 8,6,4,8,7,6,5,9,6,6,7,7,8,8,9,7,9,8,10,2,11,2,13,2,17,2,19,2,20,2,22,
%U A334857 2,23,2,25,5,11,3,11,4,13,3,13,4,14,2,29,2
%N A334857 Lexicographically earliest sequence of integers > 1 such that for any distinct m and n, a(m)^a(m+1) <> a(n)^a(n+1).
%C A334857 This sequence has similarities with A088177; here we raise consecutive terms, there we multiply consecutive terms.
%C A334857 This sequence contains large runs of consecutive terms where every other term equals 2.
%H A334857 Rémy Sigrist, <a href="/A334857/b334857.txt">Table of n, a(n) for n = 1..10000</a>
%H A334857 Rémy Sigrist, <a href="/A334857/a334857.gp.txt">PARI program for A334857</a>
%e A334857 The first terms, alongside a(n)^a(n+1), are:
%e A334857   n   a(n)  a(n)^a(n+1)
%e A334857   --  ----  -----------
%e A334857    1     2            4
%e A334857    2     2            8
%e A334857    3     3            9
%e A334857    4     2           16
%e A334857    5     4           64
%e A334857    6     3           27
%e A334857    7     3           81
%e A334857    8     4          256
%e A334857    9     4         1024
%e A334857   10     5           25
%e A334857   11     2           32
%e A334857   12     5          125
%e A334857   13     3          243
%o A334857 (PARI) See Links section.
%Y A334857 Cf. A088177, A334858.
%K A334857 nonn
%O A334857 1,1
%A A334857 _Rémy Sigrist_, May 13 2020