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.

A364663 a(n+1) = a(|n-a(n)*a(n-1)|)+1; a(0) = 0.

This page as a plain text file.
%I A364663 #11 Aug 11 2023 10:03:10
%S A364663 0,1,2,1,2,3,2,1,4,3,2,3,4,1,4,3,2,3,4,3,2,5,4,3,4,5,4,3,4,3,4,5,4,5,
%T A364663 2,5,6,3,4,5,4,3,4,5,4,5,6,3,4,7,6,5,6,5,4,3,6,5,4,5,6,5,6,5,6,3,4,5,
%U A364663 4,5,8,5,6,5,6,5,6,7,6,7,4,7,6,5,6,5,4,5,6,5,6,7,8,7,4,5,6
%N A364663 a(n+1) = a(|n-a(n)*a(n-1)|)+1; a(0) = 0.
%C A364663 a(-1) can be set to any finite value and it does not affect the sequence.
%F A364663 a(n) ~ (3*n)^(1/3)  (conjectured).
%e A364663 a(1) = a(|0-a(0)*____|)+1 = a(0)+1 = 1.
%e A364663 a(2) = a(|1-a(1)*a(0)|)+1 = a(1)+1 = 2.
%e A364663 a(3) = a(|2-a(2)*a(1)|)+1 = a(0)+1 = 1.
%o A364663 (Python)
%o A364663 a=[0];
%o A364663 for n in range(100):
%o A364663     a.append(a[abs(n-a[n]*a[n-1])]+1)
%o A364663 (PARI) N=100; a=vector(N); a[2]=1; for(n=1,N-2,a[n+2]=a[1+abs(n-a[n]*a[n+1])]+1);
%Y A364663 Cf. A364197, A340224, A339929.
%Y A364663 Cf. A005185, A004001, A003056, A340134, A007660.
%K A364663 nonn
%O A364663 0,3
%A A364663 _Rok Cestnik_, Aug 01 2023