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.

A160670 Duplicate of A145985.

This page as a plain text file.
%I A160670 #12 Jun 07 2024 04:05:21
%S A160670 7,5,3,89,83,71,59,53,47,41,29,17,11,3,887,863,827,821,809,773,761,
%T A160670 743,719,683,653,647,641,617,599,569,557,521,509,491,479,443,431,401,
%U A160670 383,359,353,347,317,281,257,239,227,191,179,173,137,113,89,71,59,53,47,29
%N A160670 Duplicate of A145985.
%C A160670 Previous name was: Primes in A160668 in order of appearance.
%o A160670 (UBASIC)
%o A160670 10 'recipseq, _Enoch Haga_, May 22 2009
%o A160670 20 N=3:print N:C=2
%o A160670 30 A=3:S=sqrt(N)
%o A160670 40 B=N/A
%o A160670 50 if A*B=int(N) then 70
%o A160670 60 A=A+2:if A<S then 40
%o A160670 70 if N=prmdiv(N) then print N;:else 130
%o A160670 80 if alen(N)=1 then print 10^1-N;:P=prmdiv(10^1-N):goto 120
%o A160670 90 if alen(N)=2 then print 10^2-N;:P=prmdiv(10^2-N):goto 120
%o A160670 100 if alen(N)=3 then print 10^3-N;:P=prmdiv(10^3-N):goto 120
%o A160670 110 if alen(N)=4 then print 10^4-N;:P=prmdiv(10^4-N)
%o A160670 120 print P;C:C=C+1:stop
%o A160670 130 N=N+2:S=sqrt(N):goto 40
%Y A160670 Cf. A160668, A160669.
%K A160670 dead
%O A160670 1,1
%A A160670 _Enoch Haga_, May 23 2009