References to sieve

44 seqfan posts

Tue Aug 16 20:47:50 CEST 2011    [seqfan] Re: Sigma-related sequence not in OEIS, need 4th term
Tue Aug 16 17:40:05 CEST 2011    [seqfan] Re: Sigma-related sequence not in OEIS, need 4th term
Tue Aug 16 11:41:48 CEST 2011    [seqfan] Re: Sigma-related sequence not in OEIS, need 4th term
Mon Aug 15 21:45:30 CEST 2011    [seqfan] Sigma-related sequence not in OEIS, need 4th term
Sun Jan 16 03:53:34 CET 2011    [seqfan] Re: Somebody knows this conjecture?
Wed Jan 12 10:53:34 CET 2011    [seqfan] Re: Linear recurrences with large gaps
Thu Oct 21 01:11:55 CEST 2010    [seqfan] Re: A057652 has no more terms below 10^6
Wed Oct 20 20:03:39 CEST 2010    [seqfan] Re: A057652 has no more terms below 10^4
Wed Oct 20 02:09:24 CEST 2010    [seqfan] Re: A057652 has no more terms below 10^4
Tue Oct 19 17:16:17 CEST 2010    [seqfan] Re: A057652 has no more terms below 10^4
Tue Oct 19 04:42:02 CEST 2010    [seqfan] Re: A057652 has no more terms below 10^4
Mon Oct 18 17:08:27 CEST 2010    [seqfan] Re: A057652 has no more terms below 10^4
Sun Oct 17 11:29:40 CEST 2010    [seqfan] Re: A057652 has no more terms below 10^4
Sat Oct 16 01:42:00 CEST 2010    [seqfan] A057652 has no more terms below 10^4
Fri Oct 1 15:40:18 CEST 2010    [seqfan] Re: [math-fun] Triangular+Triangular = Factorial
Thu Sep 30 22:51:52 CEST 2010    [seqfan] Re: [math-fun] Triangular+Triangular = Factorial
Thu Aug 26 19:05:15 CEST 2010    [seqfan] Re: Poll: Sequences Suitable For Crunchers vs. Formula Finding Algorithms
Thu Aug 26 18:59:51 CEST 2010    [seqfan] Re: Poll: Sequences Suitable For Crunchers vs. Formula Finding Algorithms
Fri Aug 13 18:55:34 CEST 2010    [seqfan] Re: Is this right? Main diagonal A[n.n] of array A[k, n] = n-th natural number m such that m and m+2 are both divisible by exactly k primes (counted with multiplicity).
Fri Aug 13 10:38:32 CEST 2010    [seqfan] Re: Is this right? Main diagonal A[n.n] of array A[k, n] = n-th natural number m such that m and m+2 are both divisible by exactly k primes (counted with multiplicity).
Thu Aug 12 21:07:41 CEST 2010    [seqfan] Re: Is this right? Main diagonal A[n.n] of array A[k, n] = n-th natural number m such that m and m+2 are both divisible by exactly k primes (counted with multiplicity).
Thu Aug 12 20:48:48 CEST 2010    [seqfan] Re: Is this right? Main diagonal A[n.n] of array A[k, n] = n-th natural number m such that m and m+2 are both divisible by exactly k primes (counted with multiplicity).
Thu Aug 12 20:24:17 CEST 2010    [seqfan] Re: Is this right? Main diagonal A[n.n] of array A[k, n] = n-th natural number m such that m and m+2 are both divisible by exactly k primes (counted with multiplicity).
Sat Jul 31 23:04:36 CEST 2010    [seqfan] Re: help needed editing A175625
Fri Jun 11 01:05:06 CEST 2010    [seqfan] Re: Noninterfering picket fence seeds
Fri Jun 11 00:52:52 CEST 2010    [seqfan] Re: Noninterfering picket fence seeds
Tue Jun 8 14:06:48 CEST 2010    [seqfan] Re: nice base-dependent sequence
Mon Jun 7 17:08:29 CEST 2010    [seqfan] Re: nice base-dependent sequence
Tue Jun 1 13:30:20 CEST 2010    [seqfan] Re: nice base-dependent sequence
Mon Mar 15 11:23:33 CET 2010    [seqfan] request: confirmation of processed edit
Mon Oct 26 02:56:06 CET 2009    [seqfan] Re: Guided browsing of the OEIS based upon personal preferences?
Sun Oct 25 19:53:08 CET 2009    [seqfan] Re: Guided browsing of the OEIS based upon personal preferences?
Sun Oct 25 17:56:56 CET 2009    [seqfan] Re: Guided browsing of the OEIS based upon personal preferences?
Sun Oct 25 17:01:04 CET 2009    [seqfan] Guided browsing of the OEIS based upon personal preferences?
Tue Aug 25 22:35:05 CEST 2009    [seqfan] Re: Help with sequence
Tue Aug 25 20:35:23 CEST 2009    [seqfan] Re: Help with sequence
Thu Jun 11 01:00:39 CEST 2009    [seqfan] Re: Toothpick sequences (again)
Tue Jun 9 21:05:38 CEST 2009    [seqfan] Re: A078467: Proof of a(34) = 622699582951
Fri Jun 5 00:25:37 CEST 2009    [seqfan] Re: Toothpick sequences (again)
Mon Apr 27 15:33:44 CEST 2009    [seqfan] Re: confused about toothpick sequence A139250!
Fri Oct 31 22:53:19 CET 2008    [seqfan] Re: Sieving method for composite numbers described / used in A146071
Fri Oct 31 20:59:18 CET 2008    [seqfan] Re: Sieving method for composite numbers described / used in A146071
Fri Oct 31 20:42:36 CET 2008    [seqfan] Re: Sieving method for composite numbers described / used in A146071
Fri Oct 31 20:13:08 CET 2008    [seqfan] Re: Sieving method for composite numbers described / used in A146071
Index of A-numbers in seqfan: by ascending order    by month    by frequency    by keyword
sieve  
Links to OEIS content are included according to The OEIS End-User License Agreement .