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.

A365390 Inverse permutation of A356867, where A356867 is Sycamore's Doudna variant D(3).

This page as a plain text file.
%I A365390 #19 Sep 17 2023 05:45:21
%S A365390 1,2,3,5,4,6,10,8,9,7,28,15,82,11,12,17,244,18,730,14,30,29,2188,24,
%T A365390 13,83,27,20,6562,21,19684,26,84,245,19,45,59050,731,246,23,177148,33,
%U A365390 531442,32,36,2189,1594324,51,37,16,732,86,4782970,54,31,35,2190,6563,14348908,42,43046722,19685,90,53,85,87,129140164
%N A365390 Inverse permutation of A356867, where A356867 is Sycamore's Doudna variant D(3).
%H A365390 Rémy Sigrist, <a href="/A365390/b365390.txt">Table of n, a(n) for n = 1..10000</a>
%H A365390 Rémy Sigrist, <a href="/A365390/a365390.gp.txt">PARI program</a>
%H A365390 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A365390 For all n >= 1, A356867(a(n)) = n.
%o A365390 (PARI)
%o A365390 up_to = 1+(3^15);
%o A365390 A365390list(up_to) = { my(v=vector(up_to),met=Map(),h=0,ak); for(i=1,#v,if(1==vecsum(digits(i,3)), v[i] = i; h = i, ak = v[i-h]; forprime(p=2,,if(3!=p && !mapisdefined(met,p*ak), v[i] = p*ak; break))); mapput(met,v[i],i)); my(invs=List([]),x); for(i=1,oo,if(mapisdefined(met,i,&x), listput(invs,x), if(isprime(i)&&i>4, listput(invs, 1+(3^(primepi(i)-2))), return(Vec(invs))))); };
%o A365390 v365390 = A365390list(up_to);
%o A365390 A365390(n) = v365390[n];
%o A365390 for(n=1,#v365390,print1(A365390(n),", "));
%o A365390 (PARI) See Links section.
%Y A365390 Cf. A365389 (one less), A356867 (inverse), A364958 (fixed points).
%Y A365390 Cf. also A005941.
%K A365390 nonn
%O A365390 1,2
%A A365390 _Antti Karttunen_, Sep 15 2023