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 A152871 #17 Sep 08 2022 08:45:39 %S A152871 3,5,11,13,19,29,53,59,61,67,109,197,227,251,499,509,773,797,827,971, %T A152871 1013,1019,1021,1549,1987,2029,3083,3299,3323,4091,4093,4099,6163, %U A152871 8179,15413,16187,16381,28669,30781,31219,32707,32749,50123,62213,64709,64763 %N A152871 Irregular table with first row containing the single term 3; in the n-th row, n>=2, we list in increasing order those d=2^(n+1)-a, for each term a in all the preceding rows, such that d is prime. %C A152871 Since primes above the n-th row are <2^n, primes in the n-th row are >2^(n+1)-2^n=2^n. Thus in different rows primes are different. %C A152871 Questions: 1) Is every row nonempty? 2) Is the sequence infinite (an infinite number of nonempty rows)? %H A152871 Jason Kimberley, <a href="/A152871/b152871.txt">Table of n, a(n) for n = 1..1016</a> %e A152871 1: 3; %e A152871 2: 5; %e A152871 3: 11, 13; %e A152871 4: 19, 29; %e A152871 5: 53, 59, 61; %e A152871 6: 67, 109; %e A152871 7: 197, 227, 251; %e A152871 8: 499, 509; %e A152871 9: 773, 797, 827, 971, 1013, 1019, 1021; %o A152871 (Magma) %o A152871 A152871and2 := %o A152871 function(N) %o A152871 A := [[3]]; C := [1]; %o A152871 for n in [2..N] do %o A152871 C[n] := 0; %o A152871 A[n] := []; %o A152871 for a in Reverse(&cat A) do %o A152871 d := 2^(n+1) - a; %o A152871 if %o A152871 IsPrime(d) %o A152871 then %o A152871 Append(~A[n],d); %o A152871 C[n] +:= 1; %o A152871 end if; %o A152871 end for; %o A152871 end for; %o A152871 return A, C; %o A152871 end function; %o A152871 A152871and2(20); %Y A152871 The n-th row has length A152872(n). %Y A152871 Cf. A152451. %K A152871 nonn,easy,tabf %O A152871 1,1 %A A152871 _Vladimir Shevelev_, Dec 14 2008 %E A152871 Heavily edited by _Jason Kimberley_, Feb 12 2013