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.
%I A386364 #13 Jul 24 2025 10:52:47 %S A386364 2,3,7,5,11,23,13,17,19,37,29,53,31,41,73,43,47,83,137,59,61,67,71,79, %T A386364 131,89,97,157,101,163,103,167,107,173,109,113,127,139,149,233,353, %U A386364 151,179,277,181,281,421,613,191,193,197,199,211,223,337,227,229,239,241,251,257,263,269,271 %N A386364 Irregular triangle read by rows. The prime numbers corresponding to the distinct prime chains in A385871. Also a permutation of the primes. %C A386364 See A385871 for the full definition for this sequence. %C A386364 A permutation of the prime numbers. %e A386364 The irregular triangle begins: %e A386364 2, 3, 7; %e A386364 5, 11, 23; %e A386364 13; %e A386364 17; %e A386364 19, 37; %e A386364 29, 53; %e A386364 31; %e A386364 41, 73; %e A386364 ... %o A386364 (PARI) f(n) = my(m=1, x); while((x=(prime(n) + 2*(n - 1) + m - prime(n + m)))>= 0, if (x==0, return(m+n)); m++); \\ A385871 %o A386364 lista(nn) = my(list = List(), vp=vector(nn)); for (n=1, nn, if (!vp[n], my(v=Vec(prime(n)), m=n); vp[n] = 1; while(m = f(m), v=concat(v, prime(m)); if (m<=nn, vp[m]=1)); listput(list, v););); Vec(list); \\ _Michel Marcus_, Jul 19 2025 %Y A386364 Cf. A000040, A385871. %K A386364 nonn,tabf %O A386364 1,1 %A A386364 _Tamas Sandor Nagy_, Jul 19 2025 %E A386364 More terms from _Michel Marcus_, Jul 19 2025