References to primality
56 seqfan posts
Sun Jul 15 02:51:33 CEST 2012 [seqfan] Lucas-Lehmer pseudoprimes
Fri Apr 6 20:56:30 CEST 2012 [seqfan] Re: A (new) constant related to the Lucas-Lehmer-test. Is this worth an entry in OEIS?
Fri Apr 6 16:41:54 CEST 2012 [seqfan] Re: A (new) constant related to the Lucas-Lehmer-test. Is this worth an entry in OEIS?
Fri Mar 16 01:38:02 CET 2012 [seqfan] Re: On a claim by Chun-Xuan Jiang.
Thu Mar 15 18:30:16 CET 2012 [seqfan] Re: On a claim by Chun-Xuan Jiang.
Thu Mar 15 06:35:39 CET 2012 [seqfan] Re: On a claim by Chun-Xuan Jiang.
Thu Mar 15 07:22:27 CET 2012 [seqfan] Re: On a claim by Chun-Xuan Jiang.
Thu Mar 15 06:30:26 CET 2012 [seqfan] On a claim by Chun-Xuan Jiang.
Tue Dec 6 04:12:00 CET 2011 [seqfan] Re: Use of Easy keyword
Tue Dec 6 04:03:29 CET 2011 [seqfan] Re: Use of Easy keyword
Fri Sep 30 19:36:48 CEST 2011 [seqfan] Re: easy and bref
Fri Sep 30 19:31:31 CEST 2011 [seqfan] Re: easy and bref
Fri Sep 30 19:22:15 CEST 2011 [seqfan] Re: easy and bref
Fri Sep 30 19:07:25 CEST 2011 [seqfan] Re: easy and bref
Sat Sep 24 23:23:44 CEST 2011 [seqfan] Re: mirror numbers in A176356
Fri Sep 23 22:40:25 CEST 2011 [seqfan] Re: mirror numbers in A176356
Thu Sep 15 15:30:17 CEST 2011 [seqfan] Re: Do 20 and 105 eventually reach a prime in these sequences?
Fri Dec 10 15:36:29 CET 2010 [seqfan] Re: Semiprimes n such that n divides Fibonacci number F(n-1).
Thu Dec 9 22:37:14 CET 2010 [seqfan] Semiprimes n such that n divides Fibonacci number F(n-1).
Thu Aug 26 18:59:51 CEST 2010 [seqfan] Re: Poll: Sequences Suitable For Crunchers vs. Formula Finding Algorithms
Thu Aug 26 17:57:50 CEST 2010 [seqfan] Re: Poll: Sequences Suitable For Crunchers vs. Formula Finding Algorithms
Thu Aug 26 13:39:48 CEST 2010 [seqfan] Re: Poll: Sequences Suitable For Crunchers vs. Formula Finding Algorithms
Mon Aug 23 23:24:07 CEST 2010 [seqfan] Re: Error in A180269 Primes of the form 3^3+3*n+1
Mon Aug 23 23:11:02 CEST 2010 [seqfan] Re: A180268
Mon Aug 23 22:42:31 CEST 2010 [seqfan] Re: Error in A180269 Primes of the form 3^3+3*n+1
Mon Aug 23 22:23:04 CEST 2010 [seqfan] Re: A180268
Thu Jun 17 10:05:05 CEST 2010 [seqfan] Re: A000000 (proved/proven)
Tue Jun 15 19:06:35 CEST 2010 [seqfan] Re: (3^n+1)/2 is prime, A171381
Mon Jun 14 22:31:56 CEST 2010 [seqfan] Re: (3^n+1)/2 is prime, A171381
Mon Jun 14 19:15:45 CEST 2010 [seqfan] Re: (3^n+1)/2 is prime, A171381
Mon Jun 14 18:47:06 CEST 2010 [seqfan] Re: (3^n+1)/2 is prime, A171381
Tue Jun 1 18:31:09 CEST 2010 [seqfan] Re: Primes by rank
Sat May 29 00:10:58 CEST 2010 [seqfan] Re: Primes by rank
Sat May 29 00:10:58 CEST 2010 [seqfan] Re: Primes by rank
Fri May 28 19:26:35 CEST 2010 [seqfan] Re: Primes by rank
Fri May 28 19:26:35 CEST 2010 [seqfan] Re: Primes by rank
Fri May 28 19:06:35 CEST 2010 [seqfan] Re: Primes by rank
Fri May 28 18:30:22 CEST 2010 [seqfan] Primes by rank
Mon May 17 12:29:29 CEST 2010 [seqfan] Re: Regarding Pairs Of Number-Of-Divisors
Wed Apr 28 00:22:23 CEST 2010 [seqfan] Re: Mma code snippets in some prime modulo sequences
Mon Mar 1 22:56:17 CET 2010 [seqfan] Re: prime + factorial = prime
Mon Mar 1 22:46:38 CET 2010 [seqfan] Re: prime + factorial = prime
Thu Jan 21 12:46:13 CET 2010 [seqfan] Algorithms to decompose a prime number into weight * level + jump
Sat Jan 2 00:29:26 CET 2010 [seqfan] Primality of 2465
Sat Dec 5 00:45:23 CET 2009 [seqfan] Re: Using floretions for primality proofs
Wed Dec 2 01:04:06 CET 2009 [seqfan] Re: Using floretions for primality proofs
Wed Dec 2 00:25:05 CET 2009 [seqfan] Using floretions for primality proofs
Sat Nov 7 22:13:52 CET 2009 [seqfan] Re: Orderly Numbers (and related sequences) submitted
Tue Feb 10 06:18:52 CET 2009 [seqfan] Re: 1,6,110,2562,66222,...
Mon Feb 9 18:22:04 CET 2009 [seqfan] Re: 1,6,110,2562,66222,...
Mon Feb 9 17:20:23 CET 2009 [seqfan] Re: 1,6,110,2562,66222,...
Mon Feb 9 11:15:59 CET 2009 [seqfan] Re: 1,6,110,2562,66222,...
Mon Feb 9 00:53:05 CET 2009 [seqfan] Re: 1,6,110,2562,66222,...
Sun Feb 8 22:53:35 CET 2009 [seqfan] 1,6,110,2562,66222,...
Thu Nov 20 18:13:43 CET 2008 [seqfan] Re: Artur (by way of O. Gérard) Help Needed for factorization
Fri Oct 31 20:59:18 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
primal
Links to OEIS content are included according to
The OEIS End-User License Agreement
.