Searching for typos
22 views
Skip to first unread message
Pontus von Brömssen
May 7, 2025, 10:53:50 AM5/7/25
to seq...@googlegroups.com
The OEIS search function has a feature that finds words similar to the search terms entered. For example, searching for "coincide", the results will also include entries containing "coincides", "coincident", "coincidences", "coinciding", etc. (I'm sure I have seen this feature documented somewhere, but now I couldn't find it.)
Today I found an entry saying "primes factors" instead of "prime factors", and I decided to correct this and any other occurrences of the same phrase in other entries. But this is not doable as I get 10472 results for the search "primes factors", including all occurrences of "prime factor" and "prime factors".
Is there any way of turning this feature off, so that only exact matches are returned? (I did search the "names" file and found 4 matches, but that would of course miss any occurrences outside the Names field.)
Best regards,
Pontus von Brömssen
Robin Houston
May 7, 2025, 11:17:11 AM5/7/25
to seq...@googlegroups.com
I don't know whether there's any way to do this using the OEIS search engine, but searching with Google for this typo on the OEIS site yields three sequences, which have all apparently been corrected, as well as two wiki pages that have not:
Robin
--
You received this message because you are subscribed to the Google Groups "SeqFan" group.
To unsubscribe from this group and stop receiving emails from it, send an email to seqfan+un...@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CAND8vCVdZKVRoFW8b7tekBNYF1Bnycb%2BawBhAMay2sCK0WfJmw%40mail.gmail.com.
Pontus von Brömssen
May 7, 2025, 11:29:21 AM5/7/25
to seq...@googlegroups.com
Yes, thanks, that's how I found those a few months ago. I should have mentioned that in my previous post, but I forgot about it. But apparently, Google doesn't find all matching sequences.
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CAD9Xfq2-7KhzS_7Bg_Q3bKd7soqKg3hb_0YKrEaeqx2nGEpH%3Dw%40mail.gmail.com.
Neil Sloane
May 7, 2025, 11:39:07 AM5/7/25
to seq...@googlegroups.com
you can always download a full copy of all the entries, and search it using grep
Best regards
Neil
Neil J. A. Sloane, Chairman, OEIS Foundation.
Also Visiting Scientist, Math. Dept., Rutgers University,
Email: njas...@gmail.com
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CAND8vCXvUs6380c1MfJ9Sk1NuCjc9exUaOBghvOnvRLr0q73-A%40mail.gmail.com.
Charles Greathouse
May 7, 2025, 11:48:33 AM5/7/25
to seq...@googlegroups.com
https://github.com/oeis/oeisdata
For "primes factors" (I think this comes mostly from native French speakers) I find
%N A075255 a(n) = n - (sum of primes factors of n (with repetition)).
%N A136607 Odd primitive abundant numbers with only one prime factor 3 and only primes factors == 1 mod 6.
%C A174323 Numbers n such that omega(A000045 (n)) is a square, where omega(p) is the number of distinct primes factors of p (A001221). Remark: for the larger Fibonacci numbers F(n) (n > 300), the Maple program (below) is very slow. So we use a two-step process: factoring F(n) with the elliptic curve method, and then calculate the distinct primes factors.
%C A306701 The corresponding pairs of primes factors are (2, 2), (3, 3), (3, 5), (7, 19), (3, 5), (11, 73), (2, 2), (3, 3), (3, 5), (2, 2), (3, 3), (3, 3), (3, 5), (7, 19), (3, 5), (7, 17), (3, 5), (11, 73), (2, 2), ... with many repetitions of some pairs.
%e A319605 - 42 has 3 primes factors: 2, 3 and 7,
%C A342108 Differs from A070842 where length(m) = omega(m) = n, when length(m) is the number of digits of m (A055642) and omega(m) is the number of distinct primes factors dividing m (A001221).
%C A342109 Differs from A070843 where length(m) = omega(m) = n, when length(m) is the number of digits of m (A055642) and omega(m) is the number of distinct primes factors dividing m (A001221).
%F A349326 a(n) = A001222(A350390(n)) (the number of primes factors of the largest exponentially odd number dividing n, counted with multiplicity).
%C A349824 More precisely, a(n) = (number of prime factors of n, counted with repetition) * (sum of primes factors of n, counted with repetition): a(n) = A001414(n) * A001222(n).
%C A356850 The lower lines containing terms with primes factors of 2 and 3 visible in the image of terms up to 1000000 are curving upward, possibly repeating the earlier behavior seen where similar lines eventually join with the uppermost line. If these do in fact eventually reach the uppermost line it is plausible this will once again signal the start of a new series of much lower valued terms.
%N A362412 The number of primes factors of the square root of the largest square dividing n, counted with multiplicity.
%N A366076 The number of primes factors of the largest divisor of n that is a cubefull number (A036966), counted with multiplicity.
%C A366076 The number of distinct primes factors of the largest divisor of n that is a cubefull number is A295659(n).
%Y A366076 Similar sequence: A275812 (number of primes factors of the powerful part).
%e A372384 a(4) = 30 as 30 = 2 * 3 * 5 = 132_4 = 2_4 * 3_4 * 11_4, and both 132_4 and its primes factors contain the same distinct digits 1, 2, and 3.
%e A372384 a(10) = 132 as 132 = 2 * 3 * 11, and both 132 and its primes factors contain the same distinct digits 1, 2, and 3. See also A035141.
%e A372384 a(14) = 465 as 465 = 3 * 5 * 31 = 253_14 = 3_14 * 5_14 * 23_14, and both 253_14 and its primes factors contain the same distinct digits 2, 3, and 5.
%e A375615 The first terms, alongside the primes factors of n*a(n), are:
For "primes factors" (I think this comes mostly from native French speakers) I find
%N A075255 a(n) = n - (sum of primes factors of n (with repetition)).
%N A136607 Odd primitive abundant numbers with only one prime factor 3 and only primes factors == 1 mod 6.
%C A174323 Numbers n such that omega(A000045 (n)) is a square, where omega(p) is the number of distinct primes factors of p (A001221). Remark: for the larger Fibonacci numbers F(n) (n > 300), the Maple program (below) is very slow. So we use a two-step process: factoring F(n) with the elliptic curve method, and then calculate the distinct primes factors.
%C A306701 The corresponding pairs of primes factors are (2, 2), (3, 3), (3, 5), (7, 19), (3, 5), (11, 73), (2, 2), (3, 3), (3, 5), (2, 2), (3, 3), (3, 3), (3, 5), (7, 19), (3, 5), (7, 17), (3, 5), (11, 73), (2, 2), ... with many repetitions of some pairs.
%e A319605 - 42 has 3 primes factors: 2, 3 and 7,
%C A342108 Differs from A070842 where length(m) = omega(m) = n, when length(m) is the number of digits of m (A055642) and omega(m) is the number of distinct primes factors dividing m (A001221).
%C A342109 Differs from A070843 where length(m) = omega(m) = n, when length(m) is the number of digits of m (A055642) and omega(m) is the number of distinct primes factors dividing m (A001221).
%F A349326 a(n) = A001222(A350390(n)) (the number of primes factors of the largest exponentially odd number dividing n, counted with multiplicity).
%C A349824 More precisely, a(n) = (number of prime factors of n, counted with repetition) * (sum of primes factors of n, counted with repetition): a(n) = A001414(n) * A001222(n).
%C A356850 The lower lines containing terms with primes factors of 2 and 3 visible in the image of terms up to 1000000 are curving upward, possibly repeating the earlier behavior seen where similar lines eventually join with the uppermost line. If these do in fact eventually reach the uppermost line it is plausible this will once again signal the start of a new series of much lower valued terms.
%N A362412 The number of primes factors of the square root of the largest square dividing n, counted with multiplicity.
%N A366076 The number of primes factors of the largest divisor of n that is a cubefull number (A036966), counted with multiplicity.
%C A366076 The number of distinct primes factors of the largest divisor of n that is a cubefull number is A295659(n).
%Y A366076 Similar sequence: A275812 (number of primes factors of the powerful part).
%e A372384 a(4) = 30 as 30 = 2 * 3 * 5 = 132_4 = 2_4 * 3_4 * 11_4, and both 132_4 and its primes factors contain the same distinct digits 1, 2, and 3.
%e A372384 a(10) = 132 as 132 = 2 * 3 * 11, and both 132 and its primes factors contain the same distinct digits 1, 2, and 3. See also A035141.
%e A372384 a(14) = 465 as 465 = 3 * 5 * 31 = 253_14 = 3_14 * 5_14 * 23_14, and both 253_14 and its primes factors contain the same distinct digits 2, 3, and 5.
%e A375615 The first terms, alongside the primes factors of n*a(n), are:
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CAAOnSgRjvi6pNv97MESfoRNJgVo1d4A%3DGN56_6ycxsXUHxzvSw%40mail.gmail.com.
Bob Lyons
May 7, 2025, 11:53:27 AM5/7/25
to seq...@googlegroups.com
Grepping my local oeisdata repo, I found 25 sequences containing 'primes numbers':
~/oeis/oeisdata$ cat all | xargs rg -il '\bprimes numbers\b' | sort -u | cut -d/ -f3 | cut -d. -f1 | sed -e 's/^/https:\/\/oeis.org\//'
~/oeis/oeisdata$
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CANXmBjzw9ULxHOuiZ5dMRVHwY4ej0VUG_h%2B-KTyTy6f_n6sJ%2Bw%40mail.gmail.com.
Bob
Bob Lyons
May 7, 2025, 11:58:24 AM5/7/25
to seq...@googlegroups.com
And 14 containing "primes factors":
~/oeis/oeisdata$ cat all | xargs rg -il '\bprimes factors\b' | sort -u | cut -d/ -f3 | cut -d. -f1 | sed -e 's/^/https:\/\/oeis.org\//'
~/oeis/oeisdata$
Bob
mi...@vincico.com
May 7, 2025, 12:01:19 PM5/7/25
to seq...@googlegroups.com
Handled all the seqs on the list with A numbers greater than A300000.
Best regards,
Mike
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CAJ%3DEaLReCJ_KZGeotMpYT%2BXRmtEYZhdud%3DHFBmamVK%2BimBLG-w%40mail.gmail.com.
Pontus von Brömssen
May 7, 2025, 12:05:55 PM5/7/25
to seq...@googlegroups.com
Thanks for the replies!
I was hoping for a simpler solution (which could also be done on a phone) than downloading the entire database, but I assume that's not possible for now.
Cheers,
Cheers,
Pontus
To view this discussion visit https://groups.google.com/d/msgid/seqfan/00f301dbbf69%244241c740%24c6c555c0%24%40vincico.com.
Dario Clavijo
May 7, 2025, 12:17:17 PM5/7/25
to seq...@googlegroups.com
Hi,
Yet, you can try Bob's command in a google colab notebook from your
phone if you like:
!git clone https://github.com/oeis/oeisdata
!cat all | xargs rg -il '\bprimes numbers\b' | sort -u | cut -d/ -f3 |
Cloning takes 5 minutes.
Best regards
Darío
El mié, 7 may 2025 a las 13:06, Pontus von Brömssen
(<pontus.vo...@gmail.com>) escribió:
> To view this discussion visit https://groups.google.com/d/msgid/seqfan/CAND8vCWoSpduPe%2BiKajBBf14%3DMtz2r3%3D2uPLumzbimXQjRbzWQ%40mail.gmail.com.
Yet, you can try Bob's command in a google colab notebook from your
phone if you like:
!git clone https://github.com/oeis/oeisdata
!cat all | xargs rg -il '\bprimes numbers\b' | sort -u | cut -d/ -f3 |
Cloning takes 5 minutes.
Best regards
Darío
El mié, 7 may 2025 a las 13:06, Pontus von Brömssen
(<pontus.vo...@gmail.com>) escribió:
Bob Lyons
May 7, 2025, 12:26:12 PM5/7/25
to seq...@googlegroups.com
I forgot to mention that I create the all file using the following command in my local oeisdata directory:
find seq -name "A??????.seq" | sort > all
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CABjGZ_Bzd38yXEvoyc%3D51bCc9ZQmz%2Bf2FuSUSGEC4OQjfb-6MQ%40mail.gmail.com.
Bob
mi...@vincico.com
May 7, 2025, 12:27:12 PM5/7/25
to seq...@googlegroups.com
These “primes factors” are also handled.
Best regards,
Mike
From: seq...@googlegroups.com <seq...@googlegroups.com> On Behalf Of Bob Lyons
Sent: Wednesday, 7 May, 2025 10:58
To: seq...@googlegroups.com
Subject: Re: [SeqFan] Searching for typos
And 14 containing "primes factors":
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CAJ%3DEaLQJOjSXkFHEiuwaOkGDxmsXWZYCyeYCs%2BtEXbDQ5ZUrfw%40mail.gmail.com.
Pontus von Brömssen
May 7, 2025, 1:21:00 PM5/7/25
to seq...@googlegroups.com
That works fine on Google Colab (after replacing rg with grep). Thanks Dario!
And thanks to Mike for correcting the occurrences of "primes factors".
/Pontus
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CAJ%3DEaLQ1zuK9679aiTqwRq9XZ7j76tkP9j_5z-sqJafamzQ37g%40mail.gmail.com.
Bob Lyons
May 7, 2025, 3:03:05 PM5/7/25
to seq...@googlegroups.com
FYI, I fixed "composites numbers" in the following sequences:
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CAND8vCUUBwy23JA%2BZN_Scpv9N8PQR8rnjDRwLWZEHajfyBbDTQ%40mail.gmail.com.
Bob
Michael De Vlieger
May 7, 2025, 3:13:55 PM5/7/25
to seq...@googlegroups.com
I have to correct a bad link that has a typo (sic) with a revised link but am away from keyboard for at least an hour. All of these typos on the lists should be handled by end of business day.
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CAJ%3DEaLQnpz3oFoDvaBWT_PLKzeCr6p%2Bs5Bw1r1haM0H3r5iqiw%40mail.gmail.com.
Reply all
Reply to author
Forward
0 new messages