### References to efficient

*154 seqfan posts*

*Sat Jun 23 10:07:45 CEST 2012* [seqfan] Re: Interesting(?) sequence from permutations

*Sat Jun 23 04:52:27 CEST 2012* [seqfan] Interesting(?) sequence from permutations

*Sun May 13 13:09:44 CEST 2012* [seqfan] Is this correct paper: Oscillations in Mertens Theorems and Other Finite Sums and Products

*Sun Mar 11 17:45:41 CET 2012* [seqfan] Re: Paraffin Numbers

*Fri Feb 17 16:21:33 CET 2012* [seqfan] Re: Any algorithm for sign of sums of square roots?

*Fri Feb 17 16:21:33 CET 2012* [seqfan] Re: Any algorithm for sign of sums of square roots?

*Fri Feb 17 16:03:59 CET 2012* [seqfan] Re: Any algorithm for sign of sums of square roots?

*Fri Feb 17 16:03:59 CET 2012* [seqfan] Re: Any algorithm for sign of sums of square roots?

*Fri Feb 17 12:44:22 CET 2012* [seqfan] Any algorithm for sign of sums of square roots?

*Thu Dec 1 09:09:41 CET 2011* [seqfan] Re: Products of primorials

*Thu Dec 1 08:57:04 CET 2011* [seqfan] Re: Products of primorials

*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

*Wed Sep 21 22:53:41 CEST 2011* [seqfan] Re: Fun with subsequences

*Wed Sep 21 22:20:01 CEST 2011* [seqfan] Fun with subsequences

*Mon Sep 5 22:44:14 CEST 2011* [seqfan] Re: Most efficient algorithm for selecting divisors of an abundant number?

*Mon Sep 5 06:01:18 CEST 2011* [seqfan] Re: Most efficient algorithm for selecting divisors of an abundant number?

*Mon Sep 5 06:11:31 CEST 2011* [seqfan] Re: Most efficient algorithm for selecting divisors of an abundant number?

*Mon Sep 5 05:56:26 CEST 2011* [seqfan] Re: Most efficient algorithm for selecting divisors of an abundant number?

*Mon Sep 5 05:48:21 CEST 2011* [seqfan] Most efficient algorithm for selecting divisors of an abundant number?

*Fri Aug 26 16:51:34 CEST 2011* [seqfan] Efficient Formulae for the Number of Partitions of n into at most m parts

*Sat Jun 11 05:59:22 CEST 2011* [seqfan] Re: successive powers of 2 modulo n

*Fri Jun 10 16:17:56 CEST 2011* [seqfan] Re: successive powers of 2 modulo n

*Fri Jun 10 15:30:14 CEST 2011* [seqfan] Re: successive powers of 2 modulo n

*Fri Jun 10 09:29:48 CEST 2011* [seqfan] Re: successive powers of 2 modulo n

*Fri Jun 10 09:25:08 CEST 2011* [seqfan] Re: successive powers of 2 modulo n

*Fri Jun 10 09:22:11 CEST 2011* [seqfan] successive powers of 2 modulo n

*Tue Apr 26 14:35:32 CEST 2011* [seqfan] Some Recurrence Sequences

*Sun Apr 3 17:19:55 CEST 2011* [seqfan] An amusing paradox?

*Sun Apr 3 17:19:55 CEST 2011* [seqfan] An amusing paradox?

*Mon Mar 28 19:58:00 CEST 2011* [seqfan] Re: A122036

*Mon Mar 28 18:48:48 CEST 2011* [seqfan] Re: A122036

*Wed Mar 23 14:27:59 CET 2011* [seqfan] sigma(4n+1) mod 4 and partitions

*Fri Mar 18 19:10:33 CET 2011* [seqfan] Re: Fwd: Superseeker and email lookup moved to oeis.org

*Thu Mar 3 07:14:25 CET 2011* [seqfan] Re: Bivariate recurrence leading to univariate one with sqrt()

*Tue Mar 1 18:10:03 CET 2011* [seqfan] Re: Bivariate recurrence leading to univariate one with sqrt()

*Tue Mar 1 12:46:13 CET 2011* [seqfan] Bivariate recurrence leading to univariate one with sqrt()

*Wed Feb 23 19:49:09 CET 2011* [seqfan] Re: [math-fun] strange approximations for F(x) = partition function. regarding A000041.

*Wed Feb 23 01:05:50 CET 2011* [seqfan] Knight's tour A186441

*Sun Jan 9 04:51:00 CET 2011* [seqfan] Re: Seqfan Digest, Vol 28, Issue 4

*Fri Jan 21 21:40:26 CET 2011* [seqfan] Re: Breaking news on partition numbers.

*Fri Jan 21 19:43:39 CET 2011* [seqfan] Re: Breaking news on partition numbers.

*Fri Jan 21 18:41:35 CET 2011* [seqfan] Re: Breaking news on partition numbers.

*Sun Jan 9 04:50:57 CET 2011* [seqfan] Re: Seqfan Digest, Vol 28, Issue 4

*Tue Jan 4 23:23:59 CET 2011* [seqfan] A173670 C program

*Tue Dec 28 10:38:57 CET 2010* [seqfan] Re: Records in a Product Involving Wythoff Numbers

*Sat Nov 27 16:38:56 CET 2010* [seqfan] Groups from Grassmannian packings: a question

*Thu Oct 28 18:01:14 CEST 2010* [seqfan] Re: Who understands Granville numbers?

*Sat Oct 23 08:39:06 CEST 2010* [seqfan] Re: CROSSREFS

*Wed Oct 20 02:09:24 CEST 2010* [seqfan] Re: A057652 has no more terms below 10^4

*Sun Sep 12 00:43:57 CEST 2010* [seqfan] Re: submitting a program, while preserving preformatted text

*Sat Sep 11 21:36:21 CEST 2010* [seqfan] Re: [math-fun] Triangular+Triangular = Factorial

*Sat Sep 11 20:55:44 CEST 2010* [seqfan] Re: [math-fun] Triangular+Triangular = Factorial

*Wed Aug 25 00:19:29 CEST 2010* [seqfan] Re: A158911

*Tue Aug 24 23:47:02 CEST 2010* [seqfan] Re: A158911

*Tue Aug 24 16:50:29 CEST 2010* [seqfan] Re: 3-sequences relations using Robert Gerbicz's seeker.c

*Fri Aug 20 05:55:21 CEST 2010* [seqfan] Re: A019575 challenge

*Fri Aug 20 04:39:26 CEST 2010* [seqfan] Re: A019575 challenge

*Thu Aug 19 23:01:55 CEST 2010* [seqfan] Re: A019575 challenge

*Thu Aug 19 22:13:04 CEST 2010* [seqfan] A019575 challenge

*Sun Aug 15 01:02:59 CEST 2010* [seqfan] Re: « King-walking » integers in a square box

*Wed Aug 11 21:04:44 CEST 2010* [seqfan] Re: project: looking for connections between sequences

*Fri Jun 4 18:33:42 CEST 2010* [seqfan] Re: A048200 variant: invert [1, 2, ..., n] allowing one swap and two shift-rotate operations

*Thu Jun 3 16:49:28 CEST 2010* [seqfan] Re: A048200 variant: invert [1, 2, ..., n] allowing one swap and two shift-rotate operations

*Thu Jun 3 16:06:28 CEST 2010* [seqfan] Re: A048200 variant: invert [1, 2, ..., n] allowing one swap and two shift-rotate operations

*Thu Jun 3 14:27:46 CEST 2010* [seqfan] Re: A048200 variant: invert [1, 2, ..., n] allowing one swap and two shift-rotate operations

*Thu Jun 3 13:34:49 CEST 2010* [seqfan] Re: A048200 variant: invert [1, 2, ..., n] allowing one swap and two shift-rotate operations

*Wed Jun 2 14:04:57 CEST 2010* [seqfan] Re: A048200 variant: invert [1, 2, ..., n] allowing one swap and two shift-rotate operations

*Sun May 23 18:46:22 CEST 2010* [seqfan] Re: 3D version of A000938: 3-in-line inside the nXnXn cube

*Sun May 23 17:57:09 CEST 2010* [seqfan] Re: 3D version of A000938: 3-in-line inside the nXnXn cube

*Sat May 22 22:13:51 CEST 2010* [seqfan] Re: Discussion of A14960.

*Wed May 19 10:02:52 CEST 2010* [seqfan] Re: A method to generate sequences

*Tue May 18 16:52:55 CEST 2010* [seqfan] Re: A method to generate sequences

*Tue May 18 11:55:47 CEST 2010* [seqfan] A method to generate sequences

*Mon May 17 18:35:44 CEST 2010* [seqfan] Re: OT: telling one-to-one polynomial maps in a finite field

*Mon May 17 16:13:15 CEST 2010* [seqfan] Re: OT: telling one-to-one polynomial maps in a finite field

*Mon May 17 15:28:02 CEST 2010* [seqfan] Re: OT: telling one-to-one polynomial maps in a finite field

*Mon May 17 10:54:15 CEST 2010* [seqfan] OT: telling one-to-one polynomial maps in a finite field

*Thu Apr 15 06:38:08 CEST 2010* [seqfan] Re: Numbers not sums of perfect powers

*Tue Apr 13 03:50:05 CEST 2010* [seqfan] Re: L-reptiles

*Mon Apr 12 01:41:44 CEST 2010* [seqfan] Re: seqs whose |differences| are 1,2,3,4,...

*Sat Mar 20 01:46:42 CET 2010* [seqfan] Re: Pandigital primes in bases 8, 12, 16, 20, 36

*Wed Mar 17 01:28:36 CET 2010* [seqfan] Re: seqs whose |differences| are 1,2,3,4,...

*Sun Mar 14 13:13:53 CET 2010* [seqfan] Re: Help needed

*Wed Mar 3 06:26:45 CET 2010* [seqfan] Re: Multiplicative sequences

*Tue Feb 9 01:50:58 CET 2010* [seqfan] Re: What do you call an algorithm that is inefficient overall in some cases?

*Sun Jan 24 01:22:51 CET 2010* [seqfan] Re: doubtful relevance

*Sun Jan 24 01:09:37 CET 2010* [seqfan] Re: doubtful relevance

*Sat Jan 23 15:59:20 CET 2010* [seqfan] doubtful relevance

*Fri Jan 8 14:02:17 CET 2010* [seqfan] Diameter-avoiding graphs

*Wed Dec 30 20:02:07 CET 2009* [seqfan] Interim database of my new sequence related work, and index of existing material

*Tue Dec 29 17:42:47 CET 2009* [seqfan] Re: Help wanted on A005646 connection to A000055

*Fri Dec 11 15:20:44 CET 2009* [seqfan] Re: Most efficient way to construct a list of pandigital palindromic numbers?

*Tue Dec 8 21:27:33 CET 2009* [seqfan] Re: base keyword for uned sequences Was: Most efficient way to construct a list of pandigital palindromic numbers?

*Tue Dec 8 06:10:02 CET 2009* [seqfan] Re: Most efficient way to construct a list of pandigital palindromic numbers?

*Tue Dec 8 05:50:39 CET 2009* [seqfan] Re: Most efficient way to construct a list of pandigital palindromic numbers?

*Tue Dec 8 05:25:52 CET 2009* [seqfan] Re: Most efficient way to construct a list of pandigital palindromic numbers?

*Tue Dec 8 05:12:49 CET 2009* [seqfan] Re: Most efficient way to construct a list of pandigital palindromic numbers?

*Tue Dec 8 04:47:40 CET 2009* [seqfan] Re: Most efficient way to construct a list of pandigital palindromic numbers?

*Tue Dec 8 04:28:48 CET 2009* [seqfan] Re: Most efficient way to construct a list of pandigital palindromic numbers?

*Tue Dec 8 04:22:54 CET 2009* [seqfan] Re: Most efficient way to construct a list of pandigital palindromic numbers?

*Mon Dec 7 23:52:19 CET 2009* [seqfan] Re: Most efficient way to construct a list of pandigital palindromic numbers?

*Mon Dec 7 23:44:05 CET 2009* [seqfan] Re: Most efficient way to construct a list of pandigital palindromic numbers?

*Mon Dec 7 23:34:22 CET 2009* [seqfan] Re: Most efficient way to construct a list of pandigital palindromic numbers?

*Mon Dec 7 23:16:58 CET 2009* [seqfan] Most efficient way to construct a list of pandigital palindromic numbers?

*Wed Nov 18 00:14:53 CET 2009* [seqfan] Re: A071901: Mmca code for large n's?

*Mon Nov 9 06:01:48 CET 2009* [seqfan] Re: Orderly Numbers (and related sequences) submitted

*Fri Sep 25 03:41:10 CEST 2009* [seqfan] Re: the revolver sequence

*Thu Sep 24 20:04:50 CEST 2009* [seqfan] Re: the revolver sequence

*Thu Sep 24 16:23:50 CEST 2009* [seqfan] Re: the revolver sequence

*Thu Sep 24 05:12:44 CEST 2009* [seqfan] Re: the revolver sequence

*Thu Sep 24 04:25:13 CEST 2009* [seqfan] Re: the revolver sequence

*Thu Sep 24 00:58:14 CEST 2009* [seqfan] Re: the revolver sequence

*Wed Sep 23 23:06:47 CEST 2009* [seqfan] the revolver sequence

*Sat Sep 12 01:42:07 CEST 2009* [seqfan] Re: A120511 a(n) = min{j : A006949(j) = n}

*Fri Sep 11 18:24:22 CEST 2009* [seqfan] Re: A120511 a(n) = min{j : A006949(j) = n}

*Fri Sep 11 14:11:48 CEST 2009* [seqfan] Re: A120511 a(n) = min{j : A006949(j) = n}

*Sun Aug 30 22:24:21 CEST 2009* [seqfan] Re: Coprime To Sums

*Thu Aug 27 22:52:45 CEST 2009* [seqfan] Re: moving to wiki

*Thu Aug 27 01:10:07 CEST 2009* [seqfan] Re: US money puzzle (was "Dividing the sum of...")

*Wed Aug 26 23:44:05 CEST 2009* [seqfan] US money puzzle (was "Dividing the sum of...")

*Fri Aug 14 05:12:45 CEST 2009* [seqfan] Re: Rant on Maple code

*Thu Aug 13 19:29:29 CEST 2009* [seqfan] Re: Rant on Maple code

*Thu Aug 13 17:17:52 CEST 2009* [seqfan] Re: Rant on Maple code

*Thu Aug 13 16:46:15 CEST 2009* [seqfan] Re: Rant on Maple code

*Tue Aug 11 13:12:57 CEST 2009* [seqfan] Re: Rant on Maple code

*Mon Aug 10 11:43:03 CEST 2009* [seqfan] Rant on Maple code

*Mon Jul 6 21:40:43 CEST 2009* [seqfan] R: Seqfan Digest, Vol 10, Issue 5

*Mon Jul 6 00:55:51 CEST 2009* [seqfan] Re: Another BBP formula for ln(2) ?

*Mon Jul 6 00:55:51 CEST 2009* [seqfan] Re: Another BBP formula for ln(2) ?

*Tue Jun 23 22:51:21 CEST 2009* [seqfan] Re: Questions concerning A003418 and A002944.

*Thu Jun 18 01:29:24 CEST 2009* [seqfan] Re: Sloane's Sequence A023052

*Thu Apr 23 17:52:31 CEST 2009* [seqfan] Re: Offsets for Recurrence Sequences

*Mon Apr 20 17:32:04 CEST 2009* [seqfan] Re: Question about A002577 (Number of partitions of 2^n into powers of 2)

*Mon Apr 20 16:36:58 CEST 2009* [seqfan] Fwd: reply from Valentin Bakoev on "Question about A000290"

*Mon Apr 20 15:22:14 CEST 2009* [seqfan] Re: Question about A002577 (Number of partitions of 2^n into powers of 2)

*Mon Apr 20 11:35:00 CEST 2009* [seqfan] Re: Question about A002577 (Number of partitions of 2^n into powers of 2)

*Thu Apr 16 00:17:23 CEST 2009* [seqfan] Re: confused about toothpick sequence A139250!

*Thu Mar 26 16:00:17 CET 2009* [seqfan] Re: rational sequence $$ f_n= (\frac{n}{f_{n-1}}+1)(n+1) \; , f_0 = 1 $$

*Thu Mar 26 14:58:10 CET 2009* [seqfan] Re: rational sequence $$ f_n= (\frac{n}{f_{n-1}}+1)(n+1) \; , f_0 = 1 $$

*Thu Mar 26 13:57:18 CET 2009* [seqfan] rational sequence $$ f_n= (\frac{n}{f_{n-1}}+1)(n+1) \; , f_0 = 1 $$

*Tue Mar 10 11:17:28 CET 2009* [seqfan] guessing doubling formulas for sequences

*Sat Feb 28 16:31:13 CET 2009* [seqfan] Re: An equivalence for integer sequences (with more questions than answers)

*Fri Feb 27 23:26:20 CET 2009* [seqfan] Re: An equivalence for integer sequences (with more questions than answers)

*Fri Feb 6 23:02:02 CET 2009* [seqfan] Additive combination of unique cyclotomic polynomials

*Fri Jan 16 04:08:07 CET 2009* [seqfan] Re: A154676

*Fri Jan 16 02:24:53 CET 2009* [seqfan] Re: A154676

*Fri Jan 16 02:24:53 CET 2009* [seqfan] Re: A154676

*Fri Nov 21 17:56:04 CET 2008* [seqfan] Re: Artur (by way of O. Gérard) Help Needed for factorization

*Thu Nov 20 23:01:22 CET 2008* [seqfan] Re: Fw: COMMENT FROM submitA Zak Seidov A100836

*Thu Nov 20 08:55:52 CET 2008* [seqfan] Re: Integer Sequence Analysis in Mathematica 7

*Thu Nov 20 08:55:52 CET 2008* [seqfan] Re: Integer Sequence Analysis in Mathematica 7

Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword

efficient

Links to OEIS content are included according to
The OEIS End-User License Agreement
.