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.

A064623 Primitive subsequence of A066031: terms of A066031 which are not a multiple of some previous terms.

This page as a plain text file.
%I A064623 #8 May 13 2013 01:54:05
%S A064623 30,70,84,105,231,234,260,286,456,528,532,627,646,805,897,1116,1122,
%T A064623 1275,1364,1581,1665,1798,1924,2064,2150,2275,2565,2632,2958,2967,
%U A064623 3055,3213,3339,3526,3861,4070,4543,4824,5025,5152,5487,5658,5840,6164,6461
%N A064623 Primitive subsequence of A066031: terms of A066031 which are not a multiple of some previous terms.
%H A064623 Charles R Greathouse IV, <a href="/A064623/b064623.txt">Table of n, a(n) for n = 1..10000</a>
%t A064623 a = {30}; Do[ If[ IntegerQ[ n / Apply[ Plus, First[ Transpose[ FactorInteger[n]]]]] && Mod[ n, n - EulerPhi[n]] != 0 && First[ Union[ Mod[n, a]]] != 0, a = Append[a, n]], {n, 1, 10000} ]; a
%o A064623 (PARI) f(n)=my(f=factor(n)[,1]); #f[,1]>1 && n%sum(i=1,#f,f[i])==0
%o A064623 list(lim)=my(v=List(),p=2);forprime(q=p+1,nextprime(lim),for(n=p+1,q-1, if(f(n),for(i=1,#v,if(n%v[i]==0,next(2)));listput(v,n)));p=q);Vec(v) \\ _Charles R Greathouse IV_, Sep 08 2012
%K A064623 nonn
%O A064623 1,1
%A A064623 _Robert G. Wilson v_ and _Vladeta Jovovic_, Dec 12 2001