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.

A332864 Lexicographically earliest sequence of positive integers with the property that the distance between the first appearance of n and the first appearance of n+1 is a(n).

This page as a plain text file.
%I A332864 #55 Feb 28 2020 14:56:41
%S A332864 1,2,1,3,4,1,1,5,1,1,1,6,7,8,1,1,1,1,9,10,11,12,1,1,1,1,1,13,1,1,1,1,
%T A332864 1,1,14,1,1,1,1,1,1,1,15,16,17,18,19,1,1,1,1,1,1,1,1,20,1,1,1,1,1,1,1,
%U A332864 1,1,21,1,1,1,1,1,1,1,1,1,1,22,1,1,1,1,1,1,1,1,1,1,1,23,24,25,26,27,28
%N A332864 Lexicographically earliest sequence of positive integers with the property that the distance between the first appearance of n and the first appearance of n+1 is a(n).
%H A332864 Samuel B. Reid, <a href="/A332864/b332864.txt">Table of n, a(n) for n = 1..10000</a>
%H A332864 Samuel B. Reid, <a href="/A332864/a332864.c.txt">C program for A332864</a>
%H A332864 Samuel B. Reid, <a href="/A332864/a332864_1.png">Graph of 10000 terms</a>
%o A332864 (C) See Links section.
%o A332864 (Python)
%o A332864 a = [1]
%o A332864 for n in range(1, 30):
%o A332864     a += [1] * (a[n-1]-1)
%o A332864     a.append(n+1)
%o A332864 print(a)
%o A332864 # _Andrey Zabolotskiy_, Feb 28 2020
%Y A332864 Cf. A309681, A331910.
%K A332864 nonn
%O A332864 1,2
%A A332864 _Samuel B. Reid_, Feb 27 2020