
Look up a number sequence in the On-Line Encyclopedia of Integer Sequences
by typing consecutive numbers from your sequence of interest (signs are optional):SeqFan Mailing List: For integer sequences enthusiasts (French or English).
OEIS 100K E-Party: Join N.J.A. Sloane in celebrating over 100 000 sequences
in this wonderful collection, 40 years in the making... Here are my contributions:
- A143314 (2008-08-06) Poker hands of n cards containing a straight flush.
- A141385 (2008-07-02) A sequence obeying a third-order linear recurrence.
- A141384 (2008-06-28) Traces of the powers of an order-8 adjacency matrix.
- A140076 (2008-06-01) Pierce expansion of the cube root of 1/2.
- A140074 (2008-05-06) Excess count of the perfect squares between cubes.
- A129667 (2007-04-28) Dirichlet inverse of the Abelian group count.
- A120630 (2006-06-24) Dirichlet inverse of ¼ card( {(x,y) | x2+y2 = n} )
- A120629 (2006-06-20) Nonpowers < 0, with squarefree part ¹ 1 mod 4.
- A108942 (2005-07-20) [ Posted by third party. See note below.]
- A101188 (2004-12-08) (7m+1)(8m+1)(11m+1) is a Carmichael number.
- A101187 (2004-12-03) (6k+1)(12k+1)(18k+1) is a Carmichael number.
- A101186 (2004-12-03) m=1848+942k makes 7m+1,8m+1,11m+1 prime.
- A101088 (2004-11-30) Prime values of | B101086(k) |.
- A101087 (2004-11-30) Values of k for which | B101086(k) | is prime.
- B101086 (2004-11-30) a(0) = 0; a(1) = 1; a(n+2) = a(n+1) - 2 a(n).
- A101035 (2004-11-27) Dirichlet inverse of the gcd-sum function.
- A058789 (2000-11-30) n-hedra with n+1 vertices (and/or 2n-1 edges).
- A058788 (2000-11-29)  Table: Polyhedra with n edges and k nodes.
- A058787 (2000-11-29) Table: Polyhedra with n faces and k vertices.
- A058786 (2000-11-29) n-hedra with 2n-5 vertices (and/or 3n-7 edges).
In addition, I had a few comments to make on sequences contributed by others:- A003277 (2008-01-08) These are all the divisors of Carmichael numbers...
- A087003 (2007-04-29) is the Dirichlet inverse of the integers modulo 2.
The finite sequence A108942 (0,1,2,3,4,5,6,7,9,18,33) was not actually submitted by me to the OEIS. However, the person who submitted it (Jonathan Vos Post) did not write a single original word. He simply posted a link to my article as the only reference and cut-and-pasted my own prose verbatim as the only "comment", including the closing line whose syntax implies authorship: "Since we've actually checked that there's no other solution below n = 1500, we can be very confident that we've not missed anything..." (The motivation of that poster is to be found elsewhere.)
The simple sequence listed above as B101086 was submitted at the indicated date but was locked out of the OEIS because only its signs differ from previously listed sequences (A001607 and A077020) although it has arguably the simplest closed form among its siblings. Originally, the OEIS was mostly a collection of unsigned sequences.
![]() |
![]() Gérard P. Michon, Ph.D. |
![]() |
Neologisms:Here are the neologisms I coined (I don't know where else to put that list).
|
![]() Hemicube |
|
The above list is mostly for my own records, but it might help others trace the origins of words. | ||