CINXE.COM

<!DOCTYPE html> <html class="client-nojs" lang="en" dir="ltr"> <head> <meta charset="UTF-8"/> <title>Suggested Projects - OeisWiki</title> <script>document.documentElement.className = document.documentElement.className.replace( /(^|\s)client-nojs(\s|$)/, "$1client-js$2" );</script> <script>(window.RLQ=window.RLQ||[]).push(function(){mw.config.set({"wgCanonicalNamespace":"","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":0,"wgPageName":"Suggested_Projects","wgTitle":"Suggested Projects","wgCurRevisionId":1662629,"wgRevisionId":1662629,"wgArticleId":203740,"wgIsArticle":true,"wgIsRedirect":false,"wgAction":"view","wgUserName":null,"wgUserGroups":["*"],"wgCategories":["Suggested Projects","To-do lists"],"wgBreakFrames":false,"wgPageContentLanguage":"en","wgPageContentModel":"wikitext","wgSeparatorTransformTable":["",""],"wgDigitTransformTable":["",""],"wgDefaultDateFormat":"dmy","wgMonthNames":["","January","February","March","April","May","June","July","August","September","October","November","December"],"wgMonthNamesShort":["","Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"],"wgRelevantPageName":"Suggested_Projects","wgRelevantArticleId":203740,"wgRequestId":"b0667b7b424475a0bc9c820a","wgIsProbablyEditable":false,"wgRelevantPageIsProbablyEditable":false,"wgRestrictionEdit":[],"wgRestrictionMove":[],"wgFlaggedRevsParams":{"tags":{"style":{"levels":2,"quality":2,"pristine":4}}},"wgStableRevisionId":1662629});mw.loader.state({"site.styles":"ready","noscript":"ready","user.styles":"ready","user":"ready","user.options":"loading","user.tokens":"loading","ext.flaggedRevs.basic":"ready","mediawiki.legacy.shared":"ready","mediawiki.legacy.commonPrint":"ready","mediawiki.sectionAnchor":"ready","mediawiki.skinning.interface":"ready","mediawiki.skinning.content.externallinks":"ready","skins.monobook.styles":"ready"});mw.loader.implement("user.options@0bhc5ha",function($,jQuery,require,module){mw.user.options.set([]);});mw.loader.implement("user.tokens@0jlvv7z",function ( $, jQuery, require, module ) { mw.user.tokens.set({"editToken":"+\\","patrolToken":"+\\","watchToken":"+\\","csrfToken":"+\\"});/*@nomin*/ });mw.loader.load(["site","mediawiki.page.startup","mediawiki.user","mediawiki.hidpi","mediawiki.page.ready","mediawiki.toc","mediawiki.searchSuggest","ext.flaggedRevs.advanced"]);});</script> <link rel="stylesheet" href="/w/load.php?debug=false&lang=en&modules=ext.flaggedRevs.basic%7Cmediawiki.legacy.commonPrint%2Cshared%7Cmediawiki.sectionAnchor%7Cmediawiki.skinning.content.externallinks%7Cmediawiki.skinning.interface%7Cskins.monobook.styles&only=styles&skin=monobook"/> <script async="" src="/w/load.php?debug=false&lang=en&modules=startup&only=scripts&skin=monobook"></script>  <meta name="ResourceLoaderDynamicStyles" content=""/> <meta name="generator" content="MediaWiki 1.30.0"/> <link rel="shortcut icon" href="/favicon.ico"/> <link rel="search" type="application/opensearchdescription+xml" href="/w/opensearch_desc.php" title="OeisWiki (en)"/> <link rel="EditURI" type="application/rsd+xml" href="https://oeis.org/w/api.php?action=rsd"/> <link rel="license" href="/wiki/The_OEIS_End-User_License_Agreement"/> <link rel="alternate" type="application/atom+xml" title="OeisWiki Atom feed" href="/w/index.php?title=Special:RecentChanges&feed=atom"/>  </head> <body class="mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject page-Suggested_Projects rootpage-Suggested_Projects skin-monobook action-view"><div id="globalWrapper"> <div id="column-content"> <div id="content" class="mw-body" role="main"> <a id="top"></a> <div id="siteNotice" class="mw-body-content"><div id="localNotice" lang="en" dir="ltr"><div class="mw-parser-output"><p>This site is supported by donations to <a rel="nofollow" class="external text" href="http://oeisf.org/">The OEIS Foundation</a>. </p></div></div></div> <div class="mw-indicators mw-body-content"> </div> <h1 id="firstHeading" class="firstHeading" lang="en">Suggested Projects</h1> <div id="bodyContent" class="mw-body-content"> <div id="siteSub">From OeisWiki</div> <div id="contentSub"><div id="mw-fr-revisiontag" class="flaggedrevs_quality flaggedrevs_stable_synced plainlinks noprint nomobile"><img class="flaggedrevs-icon" src="/w/extensions/FlaggedRevs/frontend/modules/img/3.png" alt="This is a quality version of this page" title="This is a quality version of this page" />This is the <a href="/wiki/Help:Page_validation" title="Help:Page validation">stable version</a>, <a rel="nofollow" class="external text" href="https://oeis.org/w/index.php?title=Special:Log&type=review&page=Suggested_Projects">approved</a> on <i>17 January 2025</i>.<a id="mw-fr-revisiontoggle" class="fr-toggle-symbol" style="display:none;" title="show/hide details" >(+)</a><div id='mw-fr-revisiondetails'> <span class='fr-marker-60'><strong>Readability</strong>: <span class='fr-text-value'>Approved </span> </span> </div></div> </div> <div id="jump-to-nav" class="mw-jump">Jump to: <a href="#column-one">navigation</a>, <a href="#searchInput">search</a></div>  <div id="mw-content-text" lang="en" dir="ltr" class="mw-content-ltr"><div class="mw-parser-output"><p>Appending <tt>&mdash; ~~~~</tt> will automatically add — followed by your signature with a (UTC) time stamp. (You can also add the <tt>&mdash;</tt> permanently to your signature in "<a href="/wiki/Special:Preferences" title="Special:Preferences">my preferences</a>".) </p> <div id="toc" class="toc"><div class="toctitle"><h2>Contents</h2></div> <ul> <li class="toclevel-1 tocsection-1"><a href="#Need_help_with_sequences_from_enumeration_of_curves_etc._.28Neil_Sloane.2C_October_2019.29"><span class="tocnumber">1</span> <span class="toctext">Need help with sequences from enumeration of curves etc. (Neil Sloane, October 2019)</span></a></li> <li class="toclevel-1 tocsection-2"><a href="#Search_The_Ramanujan_Journal_for_sequences_.28Neil_Sloane.2C_October_2019.29"><span class="tocnumber">2</span> <span class="toctext">Search The Ramanujan Journal for sequences (Neil Sloane, October 2019)</span></a></li> <li class="toclevel-1 tocsection-3"><a href="#Look_through_the_Gathering_For_Gardner_Gift_Books_for_sequences_.28July_2019.29"><span class="tocnumber">3</span> <span class="toctext">Look through the Gathering For Gardner Gift Books for sequences (July 2019)</span></a></li> <li class="toclevel-1 tocsection-4"><a href="#Small_or_one-time_sequence_projects"><span class="tocnumber">4</span> <span class="toctext">Small or one-time sequence projects</span></a></li> <li class="toclevel-1 tocsection-5"><a href="#Large_or_ongoing_sequence_projects"><span class="tocnumber">5</span> <span class="toctext">Large or ongoing sequence projects</span></a></li> <li class="toclevel-1 tocsection-6"><a href="#Requested_sequences"><span class="tocnumber">6</span> <span class="toctext">Requested sequences</span></a> <ul> <li class="toclevel-2 tocsection-7"><a href="#Done_requests"><span class="tocnumber">6.1</span> <span class="toctext">Done requests</span></a></li> </ul> </li> <li class="toclevel-1 tocsection-8"><a href="#Other"><span class="tocnumber">7</span> <span class="toctext">Other</span></a></li> <li class="toclevel-1 tocsection-9"><a href="#Done"><span class="tocnumber">8</span> <span class="toctext">Done</span></a></li> <li class="toclevel-1 tocsection-10"><a href="#Not_done"><span class="tocnumber">9</span> <span class="toctext">Not done</span></a></li> <li class="toclevel-1 tocsection-11"><a href="#See_also"><span class="tocnumber">10</span> <span class="toctext">See also</span></a></li> </ul> </div> <h2><span class="mw-headline" id="Need_help_with_sequences_from_enumeration_of_curves_etc._.28Neil_Sloane.2C_October_2019.29">Need help with sequences from enumeration of curves etc. (Neil Sloane, October 2019)</span></h2> <p>I just created sequences <a href="http://oeis.org/A328551">A328551</a>-<a href="http://oeis.org/A328555">A328555</a>. This is just the tip of an iceberg. </p><p>It would be worth searching the references listed in the sources for those sequences (and the references in those references, etc.), looking for other sequences not in the OEIS. </p> <h2><span class="mw-headline" id="Search_The_Ramanujan_Journal_for_sequences_.28Neil_Sloane.2C_October_2019.29">Search The Ramanujan Journal for sequences (Neil Sloane, October 2019)</span></h2> <p>I never see this journal, but I stumbled across it by accident recently. It seems to have a lot of sequences buried in the articles. (You really have to look inside the articles, because you can't always tell from the titles.) </p><p>It doesn't have many references to the OEIS - this is a journal from a different world. There are 50 volumes, maybe 150 issues. Springer has it behind a pay-wall. </p><p>I have added a bunch of sequences from a few random issues that I looked at - see <a href="http://oeis.org/A328527">A328527</a> onwards. </p><p>I didn't have time to enter all the sequences from this article: </p><p>Köklüce, Bülent. "Cusp forms in S_6 (Gamma_ 0(23)), S_8 (Gamma_0 (23)) and the number of representations of numbers by some quadratic forms in 12 and 16 variables." The Ramanujan Journal 34.2 (2014): 187-208. See p. 196. (<a href="http://oeis.org/A028930">A028930</a> is Phi_1, <a href="http://oeis.org/A028959">A028959</a> is F_1.) </p><p>In particular, the nine sequences with </p><p>G.f. = Phi^i*F^j, (i+j=8) where Phi = g.f. for <a href="http://oeis.org/A028930">A028930</a>, F = g.f. for <a href="http://oeis.org/A028959">A028959</a>. on page 204 could be added (compare <a href="http://oeis.org/A328536">A328536</a>). </p> <h2><span class="mw-headline" id="Look_through_the_Gathering_For_Gardner_Gift_Books_for_sequences_.28July_2019.29">Look through the Gathering For Gardner Gift Books for sequences (July 2019)</span></h2> <p>Check these books for new sequences (and add them to the OEIS), or existing sequences (adda link from the OEIS entry to the book). </p><p><br /> G4G10 Papers: <a rel="nofollow" class="external free" href="https://www.gathering4gardner.org/g4g10-exchange-book/">https://www.gathering4gardner.org/g4g10-exchange-book/</a> </p><p>G4G11 Papers: <a rel="nofollow" class="external free" href="https://www.gathering4gardner.org/g4g11-exchange-book/">https://www.gathering4gardner.org/g4g11-exchange-book/</a> </p><p>G4G12 Papers: <a rel="nofollow" class="external free" href="https://www.gathering4gardner.org/g4g12-exchange-book/">https://www.gathering4gardner.org/g4g12-exchange-book/</a> </p><p>G4G13 Papers: <a rel="nofollow" class="external free" href="https://www.gathering4gardner.org/g4g13-exchange-book/">https://www.gathering4gardner.org/g4g13-exchange-book/</a> </p><p>The G4G10, G4G11, G4G12, and G4G13 exchange papers are all available for free. </p><p>"The complete PDF of the G4G13 exchange book (with cover art and table of co=ntents) will also be available online soon." </p><p>— <a href="/wiki/User:N._J._A._Sloane" title="User:N. J. A. Sloane">N. J. A. Sloane</a> 12:53, 22 July 2019 (EDT) </p> <h2><span class="mw-headline" id="Small_or_one-time_sequence_projects">Small or one-time sequence projects</span></h2> <ol><li> {{<a href="/w/index.php?title=Template:Sequence_of_the_Day_for_March_1_2014&action=edit&redlink=1" class="new" title="Template:Sequence of the Day for March 1 2014 (page does not exist)">Sequence of the Day for March 1 2014</a>}} through {{<a href="/w/index.php?title=Template:Sequence_of_the_Day_for_March_30_2014&action=edit&redlink=1" class="new" title="Template:Sequence of the Day for March 30 2014 (page does not exist)">Sequence of the Day for March 30 2014</a>}}. Choosing sequences and writing up a sentence or two about one interesting aspect of those sequences. <dl><dd> Done for Mar 29 - Mar 31. Many among Mar 01 - Mar 28 still missing. <small>— <a href="/wiki/User_talk:M._F._Hasler" title="User talk:M. F. Hasler">MFH</a></small> 23:11, 9 March 2014 (UTC)</dd></dl></li> <li>I or s/o else should do the same edit done in <a rel="nofollow" class="external free" href="https://oeis.org/history?seq=A210415">https://oeis.org/history?seq=A210415</a> for <a href="http://oeis.org/A210414">A210414</a>, <a href="http://oeis.org/A210416">A210416</a>-<a href="http://oeis.org/A210423">A210423</a>: <ol><li> Add < a href="/index/Se#self-referencing_sequences" >Index to the OEIS: Entries related to self-referencing sequences< /a >.</li> <li> Change the NAME in the same way.</li> <li> Add %Y Cf. <a href="http://oeis.org/A098645">A098645</a>, <a href="http://oeis.org/A098670">A098670</a>, <a href="http://oeis.org/A114134">A114134</a>. (or not!? and/or add most relevant XREFS from the index?) <br />Thanks in advance! — <a href="/wiki/User:M._F._Hasler" title="User:M. F. Hasler">M. F. Hasler</a> 15:47, 10 October 2013 (UTC)</li></ol></li> <li> Replace "<a rel="nofollow" class="external free" href="http://neilsloane.com/doc/toothlist.html">http://neilsloane.com/doc/toothlist.html</a>" by "/wiki/Catalog_of_Toothpick_and_CA_Sequences_in_OEIS". Thanks in advance! - <a href="/wiki/User:Omar_E._Pol" title="User:Omar E. Pol">Omar E. Pol</a> 14:26, 9 January 2014 (UTC) <dl><dd> This appears to have been done. As a follow-up, can we delete <a href="/wiki/Toothpick_sequences" title="Toothpick sequences">Toothpick_sequences</a> and leave <a href="/wiki/Toothpick_problem" title="Toothpick problem">Toothpick_problem</a>. Then <b>Category:Toothpick_structures</b> can be moved out of <b>Category:Toothpick_sequences</b> and placed directly in <b>Category:Toothpick_problem</b>. - <a href="/wiki/User:Danny_Rorabaugh" title="User:Danny Rorabaugh">Danny Rorabaugh</a> 15:12, 25 September 2015 (UTC). <dl><dd> I disagree with Danny's proposals. I think that only <b>Category:Toothpick_problem</b> should be deleted. <a href="/wiki/User:Omar_E._Pol" title="User:Omar E. Pol">Omar E. Pol</a> 22:55, 24 October 2015 (UTC) <dl><dd> I'm fine with keeping either one: there's just unnecessary Inception going on the way it is now. - <a href="/wiki/User:Danny_Rorabaugh" title="User:Danny Rorabaugh">Danny Rorabaugh</a> 03:15, 25 October 2015 (UTC)</dd></dl></dd></dl></dd></dl></li> <li> Replace "shell model of partitions" by "modular table of partitions". (~ 86 sequences). Thanks in advance! - <a href="/wiki/User:Omar_E._Pol" title="User:Omar E. Pol">Omar E. Pol</a> 12:50, 11 March 2014, 25 October 2015 (UTC)</li> <li> On Sat, Nov 1, 2014 at 3:03 PM, JM Bergot <thekingfishb@yahoo.ca> wrote: I just now looked at suggestions & other stuff from the get-together in early Oct. I couldn't see how to make a suggestion, not as if OEIS needs more of them. If I am certain that 5578, 12777 or 23,457,1223 are the first terms of a sequence and can find NO other with simple implements, shouldn't there be a way of getting ALL seqs beginning with these two or three numbers rather than listing ALL sequences containing them? This would mean not having to go through mounds of sequences where these numbers occur any place. <dl><dd> This would be especially useful when searching for constants. You might know only a few terms, giving 300 matches, but only 10 of which match starting from the beginning. - <a href="/wiki/User:Charles_R_Greathouse_IV" title="User:Charles R Greathouse IV">Charles R Greathouse IV</a> 15:03, 18 December 2014 (UTC)</dd></dl></li> <li> Add a link from the Draft page of every user to the page <a rel="nofollow" class="external free" href="https://oeis.org/draft">https://oeis.org/draft</a> . Thanks in advance! - <a href="/wiki/User:Omar_E._Pol" title="User:Omar E. Pol">Omar E. Pol</a> 18:14, 12 December 2014 (UTC)</li> <li> It would be nice to have the total number of entries in the pages of <a rel="nofollow" class="external free" href="https://oeis.org/draft">https://oeis.org/draft</a>, for example, "Total number of entries: 256" below of the title "Proposed drafts" or above of "Showing entries 1-100 | older changes". The same for the pages of <a rel="nofollow" class="external free" href="https://oeis.org/editing">https://oeis.org/editing</a>. <a href="/wiki/User:Omar_E._Pol" title="User:Omar E. Pol">Omar E. Pol</a> 13:14, 11 October 2015 (UTC)</li> <li> Change links to <b>prothsearch.net</b> (<a rel="nofollow" class="external text" href="https://oeis.org/search?q=%22prothsearch.net%22&language=english&go=Search">search results</a>) with <b>prothsearch.com</b>. - <a href="/wiki/User:Max_Alekseyev" title="User:Max Alekseyev">Max Alekseyev</a> 04:58, 29 November 2017 (UTC); updated <a href="/wiki/User:Max_Alekseyev" title="User:Max Alekseyev">Max Alekseyev</a> (<a href="/w/index.php?title=User_talk:Max_Alekseyev&action=edit&redlink=1" class="new" title="User talk:Max Alekseyev (page does not exist)">talk</a>) 23:45, 23 May 2023 (EDT)</li> <li> The History of a sequence or of a user shows a line "newer changes | Showing entries 11-20 | older changes" at the top of page. Can we have the same line at the bottom of page. This is to avoid having to scroll up to the top of the page when arrived at the bottom. <a href="/wiki/User:Michel_Marcus" title="User:Michel Marcus">Michel Marcus</a> (<a href="/wiki/User_talk:Michel_Marcus" title="User talk:Michel Marcus">talk</a>) 09:36, 29 June 2021 (EDT)</li> <li> Add link to a user's editing history on his wiki user page. <a href="/wiki/User:Yifan_Xie" title="User:Yifan Xie">Yifan Xie</a> (<a href="/wiki/User_talk:Yifan_Xie" title="User talk:Yifan Xie">talk</a>) 09:14, 8 April 2023 (EDT)</li> <li> Change links to <b>artofproblemsolving.com/Forum/viewtopic.php?t=ZZZZZZ</b> (<a rel="nofollow" class="external text" href="https://oeis.org/search?q=%22artofproblemsolving.com%2FForum%2Fviewtopic.php%22&go=Search">search results</a>), where ZZZZZZ is a number, to <b>artofproblemsolving.com/community/hZZZZZZ</b>. - <a href="/wiki/User:Max_Alekseyev" title="User:Max Alekseyev">Max Alekseyev</a> (<a href="/w/index.php?title=User_talk:Max_Alekseyev&action=edit&redlink=1" class="new" title="User talk:Max Alekseyev (page does not exist)">talk</a>) 23:45, 23 May 2023 (EDT)</li> <li> There is a finite number of OEIS sequences with a broken link to citeseerx.ist.psu.edu . One can search for them entering link:citeseerx in the OEIS search bar. The lines of concern also have a doi=10.x.x.x.x number in the link. The method to update the link is described in <a rel="nofollow" class="external text" href="https://math.meta.stackexchange.com/questions/35421">stackexchange</a>: (i) Upload the *.tsv file with a corrective database, expand it so it grows to approximately 624 MBytes . (ii) Look up the dotted number after the doi in that ASCII file. Example: if the broken link contains doi=10.1.1.366.9997 (plus some adorning strings like viewdoc), use the Linux/Unix grep to search for the dotted substring <pre> grep -F 10.1.1.366.9997 citeseerx_checksums.tsv</pre><pre>ae33a269baba5e8b1038e719fb3209e8a00abec5 10.1.1.366.9997 pdf</pre> (Ignore output for the obsolete ps format). (iii) The new URL is <pre>https://citeseerx.ist.psu.edu/pdf/ae33a269baba5e8b1038e719fb3209e8a00abec5</pre> where the hex-number at the end of the new URL is the individual 40-digit SHA of the first column in the tsv-file. - <a href="/wiki/User:R._J._Mathar" title="User:R. J. Mathar">R. J. Mathar</a> (<a href="/wiki/User_talk:R._J._Mathar" title="User talk:R. J. Mathar">talk</a>) 05:02, 5 August 2024 (EDT)</li></ol> <h2><span class="mw-headline" id="Large_or_ongoing_sequence_projects">Large or ongoing sequence projects</span></h2> <ol><li> Look through journals and books, especially those available on the web, for (a) new sequences (add them!), (b) references to existing sequences (add a reference or link to that entry), and (c) mentions of the OEIS (add them to the list of "<a href="/wiki/Works_Citing_OEIS" title="Works Citing OEIS">Works Citing the OEIS</a>" on the wiki). The following is a partial list of journals and books to look at. <dl><dd><dl><dd> <a rel="nofollow" class="external text" href="http://amc.imfm.si/index.php/amc/">ARS MATHEMATICA CONTEMPORANEA</a></dd> <dd> <a rel="nofollow" class="external text" href="http://www.combinatorics.org/">Electronic J. Combinatorics</a></dd> <dd> <a rel="nofollow" class="external text" href="http://www.doaj.org/">Directory of open access journals</a> (clicking on "Browse" on the left then on "Mathematics and Statistics" leads to the mathematical branch)</dd> <dd> <a rel="nofollow" class="external text" href="http://www.ams.org/jourcgi/jrnl_toolbar_nav/era_all">Electronic Research Announcements of Amer. Math. Soc.</a></dd> <dd> <a rel="nofollow" class="external text" href="http://www.sciencedirect.com/science/journal/01956698">European J. Combinatorics</a></dd> <dd> <a rel="nofollow" class="external text" href="http://www.emis.de/journals/EM/">Experimental Mathematics</a></dd> <dd> <a rel="nofollow" class="external text" href="http://www.fq.math.ca/">Fibonacci Quarterly</a></dd> <dd> <a rel="nofollow" class="external text" href="http://www.integers-ejcnt.org/">Integers: Electronic Journal of Combinatorial Number Theory</a></dd> <dd> <a rel="nofollow" class="external text" href="http://pubs3.acs.org/acs/journals/toc.page?incoden=jcisd8">J. Chem. Inform. Comput. Sci.</a> (Enumerative chemistry, now renamed as J. Chem. Info. and Modeling)</dd> <dd> <a rel="nofollow" class="external text" href="http://www.cs.uwaterloo.ca/journals/JIS/">J. Integer Sequences</a></dd> <dd> Maple Tech. [I don't know if this is still being published, but Volume 4 in 1997 mentioned several sequences, not all of which were in the OEIS. - <a href="/wiki/User:N._J._A._Sloane" title="User:N. J. A. Sloane">N. J. A. Sloane</a> 16:39, 21 June 2021 (EDT)]</dd> <dd> <a rel="nofollow" class="external text" href="http://www.math.leidenuniv.nl/~naw/index.php?taal=1">Nieuw Archief voor Wiskunde</a></dd> <dd> <a rel="nofollow" class="external text" href="http://royalsocietypublishing.org/journals">Royal Society journals</a></dd> <dd> <a rel="nofollow" class="external text" href="http://en.wikipedia.org/wiki/List_of_mathematics_journals">Wikipedia list of math journals</a></dd></dl></dd></dl></li> <li> Max Alekseyev, <a rel="nofollow" class="external text" href="https://web.archive.org/web/*/http://list.seqfan.eu/pipermail/seqfan/2011-October/015693.html">automated discovery of unknown formulae</a>, posting to <a href="/wiki/SeqFan" class="mw-redirect" title="SeqFan">SeqFan</a> on Oct 25 2011. The project is ongoing at the George Washington University. — <a href="/wiki/User:Max_Alekseyev" title="User:Max Alekseyev">Max Alekseyev</a> 12:57, 25 December 2011 (UTC)</li> <li> Indexing/cross-referencing large [and especially poorly documented/cross-linked] "series", e.g. Decimal expansion of 1/3, 2/3, <a rel="nofollow" class="external text" href="https://oeis.org/A020793">1/6</a>, 5/6, <a rel="nofollow" class="external text" href="https://oeis.org/A177057">7/6</a>,1/7,......,<a rel="nofollow" class="external text" href="http://oeis.org/A022002">1/998</a>, (and ultimately all "cons" sequences). — <a href="/wiki/User:Maximilian_F._Hasler" class="mw-redirect" title="User:Maximilian F. Hasler">M. F. Hasler</a> 21:48, 24 October 2011 (UTC) <dl><dd> BTW, this project would merit a page on its own to synchronize / show progress / manage "TO DO's", etc. — <a href="/wiki/User:Maximilian_F._Hasler" class="mw-redirect" title="User:Maximilian F. Hasler">M. F. Hasler</a> 21:48, 24 October 2011 (UTC)</dd></dl></li> <li> Improve the index (since we do not yet have categories), especially <ul><li> for sequences of some 1000+ categories like <a href="/wiki/Index_to_OEIS:_Section_De" title="Index to OEIS: Section De">decimal expansion of ...</a></li> <li> by wikifying cross references inside the index (e.g. on the above page, "see square roots" or "decagon is spelled 10-gon..." etc.) — <a href="/wiki/User:Maximilian_F._Hasler" class="mw-redirect" title="User:Maximilian F. Hasler">M. F. Hasler</a> 03:55, 26 October 2011 (UTC)</li> <li> Perhaps add an index to the hypergeometric recurrences in the spirit of the linear recurrences. Essentially covering all the sequences with a square root in the o.g.f. including many walks, Catalan and Motzkin sequences. — <a href="/wiki/User:R._J._Mathar" title="User:R. J. Mathar">R. J. Mathar</a> 11:46, 14 November 2011 (UTC) <ul><li> Richard, I think this would be a great project, certainly of importance. I'm not sure what the best way to categorize them is (an analogue, hopefully, of your "signature" for linear recurrences) but I've also seen the need. <a href="/wiki/User:Charles_R_Greathouse_IV" title="User:Charles R Greathouse IV">Charles R Greathouse IV</a> 04:26, 31 January 2012 (UTC)</li> <li> Started a section in the "Rea" section of the index under "recurrences, hypergeometric" which uses a major order following the number of terms involved, a minor order following the order of the polynomial of the coeffs., and the integer coeffs. of the polys. from high to low degree. The defining convention is actually that the terms are written poly0*a(n)+poly1*a(n-1)+...=0, because the n-depend. of the poly(i) depend on the agreement on the indexing (increasing, decreasing, offset) of the a(i). Is this the most common formulation of the recurrence? <a href="/wiki/User:R._J._Mathar" title="User:R. J. Mathar">R. J. Mathar</a> 12:41, 29 February 2012 (UTC)</li></ul></li></ul></li> <li> Check terms, add proper names, edit the 1730 <a rel="nofollow" class="external text" href="http://oeis.org/search?q=keyword%3Auned&sort=&go=Search">unedited</a> sequences. <div class="floatright"><a href="/w/index.php?title=File:Uned-2011-11-07.png&filetimestamp=20111107171050&" class="image" title="The top contributors of uned sequences are Bagula at 74%, Lagneau at 3%, and Shevelev at 2%."><img alt="The top contributors of uned sequences are Bagula at 74%, Lagneau at 3%, and Shevelev at 2%." src="/w/images/1/1c/Uned-2011-11-07.png" width="404" height="259" /></a></div></li> <li> Go through Guy's Unsolved Problems in Number Theory (UPNT) and add references (to papers referenced by Guy as well as to UPNT itself, with the section), formulas, and any other relevant material; also add new sequences as needed. I think the best approach would be a distributed project where many people each volunteer to take one or more sections. <a href="/wiki/User:Charles_R_Greathouse_IV" title="User:Charles R Greathouse IV">Charles R Greathouse IV</a> 04:43, 15 March 2012 (UTC)</li> <li> More important and more urgent: find out the present state of Richard Guy's updates in preparation of the new edition of UPNT! - N. J. A. Sloane, Mar 20, 2013</li> <li> Create a "community portal" with a corner (or simply a separate page) "<a href="/wiki/TO_DO_on_OEIS" class="mw-redirect" title="TO DO on OEIS">TO DO on OEIS</a>", where one could post "request of jobs to be done" (instead of posting to SeqFan list), like: Errors to correct -- Please double-check, I suspect an error in Seq. Annn -- Someone who feels competent, please calculate more terms for Annn concerned with ... [I know, KW "more" essentially means the same...] -- etc. — <a href="/wiki/User:Maximilian_F._Hasler" class="mw-redirect" title="User:Maximilian F. Hasler">M. F. Hasler</a> 13:44, 24 August 2012 (UTC)</li> <li> Create an iOS interface or app; I'm willing to make an OEIS interface for iPhone/iPod touch/iPad. If appropriate, any suggestions on how to access the database from outside? — <a href="/wiki/User:Jens_Bossaert" title="User:Jens Bossaert">Jens Bossaert</a> 18:47, 7 April 2013 (UTC) <dl><dd> I'm curious as to what you'd want the application to do (<a rel="nofollow" class="external text" href="http://xkcd.com/1174/">beyond what the site does</a>, of course). The project sounds interesting and I might be able to help (though I don't have an Apple developer account).</dd> <dd> As for accessing the database, I just use https://oeis.org/search?q=id%3AA000001&fmt=text. Or do you mean something else?</dd> <dd> <a href="/wiki/User:Charles_R_Greathouse_IV" title="User:Charles R Greathouse IV">Charles R Greathouse IV</a> 18:58, 7 April 2013 (UTC)</dd></dl></li> <li> Preserve line breaks in pink-box comments. - <a href="/wiki/User:Joerg_Arndt" title="User:Joerg Arndt">Joerg Arndt</a> 12:27, 25 April 2013 (UTC) <ul><li> Done! <a href="/wiki/User:Andrey_Zabolotskiy" title="User:Andrey Zabolotskiy">Andrey Zabolotskiy</a> (<a href="/w/index.php?title=User_talk:Andrey_Zabolotskiy&action=edit&redlink=1" class="new" title="User talk:Andrey Zabolotskiy (page does not exist)">talk</a>) 19:12, 22 April 2023 (EDT)</li></ul></li> <li> Add the keyword "more" where obviously needed. I did that for up to <a href="http://oeis.org/A001500">A001500</a>. The file stripped.gz is of great help with this task. — <a href="/wiki/User:Joerg_Arndt" title="User:Joerg Arndt">Joerg Arndt</a> 13:56, 21 May 2013 (UTC)</li> <li> Go through sequences marked <span class="plainlinks"><a rel="nofollow" class="external text" href="http://oeis.org/search?q=keyword%3Amore+keyword%3Aeasy">keyword:more keyword:easy</a></span> and either expand or reclassify. - <a href="/wiki/User:Charles_R_Greathouse_IV" title="User:Charles R Greathouse IV">Charles R Greathouse IV</a> 05:44, 19 June 2013 (UTC)</li> <li> Add links to those <span class="plainlinks"><a rel="nofollow" class="external text" href="http://oeis.org/search?q=ref%3AarXiv">references with arXiv identifiers</a></span> to make them easier to follow. The search responds with 9 pages (approx. 90 sequences) as of 04 May 2017. </li> <li> <a href="/wiki/Conservation_of_web_pages" title="Conservation of web pages">Conservation of web pages</a> linked to from OEIS, from <a href="/wiki/User:N._J._A._Sloane" title="User:N. J. A. Sloane">Neil Sloane</a>, Oct 08, 2013</li> <li> It would be nice to have a third Plot in the button “Graph”. The appearance of the third Plot should be the same as "Plot 2" or “Plot pairs of sequences in the OEIS” with the following configuration: Sequence 1: A?????? untransformed (our sequence). Sequence 2: <a href="http://oeis.org/A000004">A000004</a> (always) untransformed. Contents of Plot: “Plot Seq2(n+shift) vs n and Seq1(n) vs n”. Appearance of Plot: “Draw line segments” (only). For instance, see this proposed Plot for <a href="http://oeis.org/A005132">A005132</a> Recaman’s sequence. See also this proposed Plot for <a href="http://oeis.org/A064413">A064413</a> EKG sequence. I think that a large number of sequences may show a nice graph using this proposed Plot. <a href="/wiki/User:Omar_E._Pol" title="User:Omar E. Pol">Omar E. Pol</a> 15:20, 30 November 2013 (UTC)</li> <li> Add the index to the signature of the linear recurrences and the g.f. to each of the sequences <a href="http://oeis.org/A037674">A037674</a> - <a href="http://oeis.org/A037799">A037799</a>. - <a href="/wiki/User:R._J._Mathar" title="User:R. J. Mathar">R. J. Mathar</a> 19:16, 30 April 2015 (UTC)</li> <li> Allow editors to sort the "Sequences awaiting review" by other columns. - <a href="/wiki/User:Danny_Rorabaugh" title="User:Danny Rorabaugh">Danny Rorabaugh</a> 14:38, 25 September 2015 (UTC)</li> <li> Is it possible for a search for "Lukasiewicz" to give both "Lukasiewicz" and "Łukasiewicz" and for "Waclaw" to give both "Waclaw" and "Wacław"?. - <a href="/wiki/User:Danny_Rorabaugh" title="User:Danny Rorabaugh">Danny Rorabaugh</a> 16:53, 13 October 2015 (UTC)</li> <li> What would be the best way to index, collect, or highlight the open questions, conjectures, and empirical observations on OEIS? I would love to have a keyword "conj" and/or a new section OPEN PROBLEMS within the entries so problems that are still open can be more easily identified. The keyword could be used for entries with questions specifically related to the sequence, not just for sequences related to some conjecture. The section could contain only the still unanswered items, with any questions that are subsequently answered moved to COMMENTS. - <a href="/wiki/User:Danny_Rorabaugh" title="User:Danny Rorabaugh">Danny Rorabaugh</a> 18:59, 12 May 2016 (UTC) <dl><dd> It is an interesting idea, and it has been considered in the past. The trouble is, almost every entry - well, say fifty thousand entries - would end up with that keyword. If you search in the OEIS for the phrases "empirical", "conjecture", "appears that", "would be nice to", "wanted", and other synonyms, you will see what I mean. And that just accounts for sequences where the contributor knew enough to admit that there was no proof. I have found that when I ask someone if they have a proof for a formula they have added to a sequence, 90% of the time the reply is "No, it just seemed to be true but I don't have a proof". So, unfortunately, formulas or comments that have been proved are in the minority. Of course such formulas are still extremely valuable to anyone who came across the sequence and wanted to know more about it. - <a href="/wiki/User:N._J._A._Sloane" title="User:N. J. A. Sloane">N. J. A. Sloane</a> 01:24, 13 May 2016 (UTC)</dd> <dd> Of the ~50k, I sense that a substantial proportion are sequences related to conjectures or are statements that have already been (dis)proved. And yes, I see assumed formulas as a recurring issue. I think having an explicit place for unproved ideas would help sort through those, and make them more available to fledgling mathematicians. - <a href="/wiki/User:Danny_Rorabaugh" title="User:Danny Rorabaugh">Danny Rorabaugh</a> 04:08, 13 May 2016 (UTC) <dl><dd> I think it would be nice to have a list of these, but I expect there are many thousands of them. Maybe put it on the wiki? - <a href="/wiki/User:Charles_R_Greathouse_IV" title="User:Charles R Greathouse IV">Charles R Greathouse IV</a> 20:06, 13 May 2016 (UTC)</dd></dl></dd></dl></li> <li> To set up a vote daily to evaluate the best five sequences submitted. This can greatly encourage new contributors. — <a href="/wiki/User:Yifan_Xie" title="User:Yifan Xie">Yifan Xie</a> (<a href="/wiki/User_talk:Yifan_Xie" title="User talk:Yifan Xie">talk</a>) 07:57, 16 April 2023 (EDT)</li></ol> <h2><span class="mw-headline" id="Requested_sequences">Requested sequences</span></h2> <p>If you have an idea for a new sequence and would like help with computing terms, straightening out the definition etc. simply post a request below. Try to include enough information so that it's clear what sequence you have in mind. Please make your request in the form <br /> # <i>Your request for a sequence to be added to the OEIS</i> ~~~~<br />Thank you. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 20:34, 24 August 2014 (UTC) </p> <ol><li> Algebra that pertains to this function I will explain here. I used a program called Geogebra to build a function that starts with a line of 5 units from origin vertical on the y axis. the units were as small as i could get, to the -13 power(the function gets large to the 13th power quickly). I used the regular polygon tool to make n+ polygons counterclockwise, starting from origin as the first point and the third point, counterclockwise, in the polygon prior, as the base for the next n+ polygon. as the polygons become larger zooming out is required and eventually comes to the point that the program won't zoom out anymore. Scrolling to the next point takes awhile using the keyboard on the computer (there is a point list on the left that allows clicking the origin point first and then clicking a point to make a base, so only getting to the next point is necessary on the screen). I started looking for patterns in the numbers of two properties. First is when the base crosses an axis/90degrees. Second is when a base changes direction off of a virtual origin and changes direction going to the next point(richochets). What I mean is when the line of the polygon created travels towards a flat plane and rebounds off it, first side and second side (counterclockwise). I obtained some numbers for crossing axis directions, being 5,8,12,20,32,52,84, the first number being crossing the vertical axis +y/180degrees. The second set was [3?4?],6,8,15,30,50,82. The first number being confusing but probably 3. The sequences for the rebounds seem to always be before the turns over the axis and also do not share as apparent similarity to those numbers as well. The numbers are the numbers of points/sides to the polygon. I am wondering if there are functions to explain the spirals formed in this function and what they are. I was originally looking for other spirals than the golden spiral. — <a href="/wiki/User:Ryan_Lawrence_Austin" title="User:Ryan Lawrence Austin">Ryan Lawrence Austin</a> 00:46, 19 February 2015 (UTC)</li> <li> <a href="/wiki/Wall-Sun-Sun_primes" title="Wall-Sun-Sun primes">Wall-Sun-Sun primes</a> or Fibonacci-Wieferich primes (<a rel="nofollow" class="external text" href="http://en.wikipedia.org/wiki/Wall-Sun-Sun_prime">Wall-Sun-Sun prime</a>, Wikipedia). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 20:34, 24 August 2014 (UTC)</li> <li> Meertens numbers (<a rel="nofollow" class="external text" href="http://en.wikipedia.org/wiki/Meertens_number">Meertens number</a>, Wikipedia), Cf. <a href="http://oeis.org/A246532">A246532</a>. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 20:34, 24 August 2014 (UTC) <ol><li> Max Alekseyev and David Applegate pushed this search to 10^45 without finding another term (<a rel="nofollow" class="external text" href="http://list.seqfan.eu/pipermail/seqfan/2014-August/013540.html">Re: Meertens numbers</a>, Seqfan). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 12:17, 19 February 2015 (UTC)</li></ol></li> <li> Composite numbers satisfying the same definition as 3737 given in paper (Romeo Mestrovic, <a rel="nofollow" class="external text" href="http://arxiv.org/abs/1211.4570">A congruence modulo n^3 involving two consecutive sums of powers and its applications</a>, arXiv, see page 8). The only known term is 3737 and there are no others up to 16000. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 20:34, 24 August 2014 (UTC)</li> <li> Lucas-Wieferich primes (R. J. McIntosh, E. L. Roettger, <a rel="nofollow" class="external text" href="http://dx.doi.org/10.1090/S0025-5718-07-01955-2">A search for Fibonacci-Wieferich and Wolstenholme primes</a>, Math. Comp. Vol. 76, No. 260 see page 2088). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 20:44, 24 August 2014 (UTC)</li> <li> Wieferich primes to base 11. Only one such prime is known (71) and any other one must be larger than approximately 5.9*10^13 (see R. Fischer, <a rel="nofollow" class="external text" href="http://www.fermatquotient.com/FermatQuotienten/FermQ_Sort.txt">Thema: Fermatquotient B^(P-1) == 1 (mod P^2)</a>). If a second such prime could be found, <a href="http://oeis.org/A178871">A178871</a> could be extended as well. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 21:21, 29 August 2014 (UTC)</li> <li> Number of Johnson polytopes by dimension for dimension n > 2, i.e. convex polytopes whose facets are n-1 dimensional convex regular polytopes but which are not regular or uniform. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 08:29, 13 September 2014 (UTC)</li> <li> Number of convex deltatopes by dimension for dimension n > 2, i.e. convex polytopes whose facets are n-1 simplices. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 08:29, 13 September 2014 (UTC)</li> <li> Number of space-filling n-hedra for n > 5 (<a rel="nofollow" class="external text" href="http://mathworld.wolfram.com/Space-FillingPolyhedron.html">Space-filling Polyhedron</a>, MathWorld). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 09:07, 13 September 2014 (UTC)</li> <li> Number of space-filling convex polytopes with regular facets by dimension for dimension n > 2 (<a rel="nofollow" class="external text" href="http://mathworld.wolfram.com/Space-FillingPolyhedron.html">Space-filling Polyhedron</a>, MathWorld). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 12:57, 13 September 2014 (UTC)</li> <li> Decimal expansion / initial digits of <a href="/wiki/Graham%27s_number" title="Graham's number">Graham's number</a>. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 14:06, 14 September 2014 (UTC)</li> <li> Descartes numbers. The only such number currently known is 198585576189 (<a rel="nofollow" class="external text" href="http://en.wikipedia.org/wiki/Descartes_number">Descartes number</a>, Wikipedia). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 19:49, 22 October 2014 (UTC) <dl><dd> (See <a href="/wiki/Descartes_number" title="Descartes number">Descartes number</a>, also called an "odd spoof perfect number", on OEISWiki.) — <a href="/wiki/User:Daniel_Forgues" title="User:Daniel Forgues">Daniel Forgues</a> 05:00, 19 June 2015 (UTC)</dd></dl></li> <li> Quasiperfect numbers (<a rel="nofollow" class="external text" href="http://en.wikipedia.org/wiki/Quasiperfect_number">Quasiperfect number</a>, Wikipedia). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 19:49, 22 October 2014 (UTC)</li> <li> Numbers n such that 10^999999+n is a megaprime. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 22:51, 29 October 2014 (UTC) <ol><li> We need a minimum of 3 terms for a sequence, and as far as I know we only have one: 593499, corresponding to a Frobenius probable-prime. As much as I like this sequence (having kicked off the process, in a way, though I was not involved with the computation) it's not yet ready. ~10^5 more probable-prime tests would be needed to discover the next two terms, taking many CPU-years. - <a href="/wiki/User:Charles_R_Greathouse_IV" title="User:Charles R Greathouse IV">Charles R Greathouse IV</a> 05:45, 30 October 2014 (UTC) <ol><li> Yes, the sequence is definitely not ready to be added yet and it might be several years (or more?), but that's okay at least for me. My intention for this section is for sequences which one possibly can't compute enough terms within a few hours/days/weeks... and which are assumed to be too hard to be added anytime soon, but for which enough terms might eventually be found to be added in the future. I also regard it as kind of a challenge proposed to everyone interested to find additional terms of the sequences listed here or to develop new algorithms to find them. The long-term goal is of course to have them all added to the OEIS eventually. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 21:39, 30 October 2014 (UTC)</li></ol></li></ol></li> <li> Baillie-Pomerance-Selfridge-Wagstaff pseudoprimes (i.e. composites where PARI's ispseudoprime function (with flag 0) returns 'true', see <a rel="nofollow" class="external text" href="http://en.wikipedia.org/wiki/Baillie–PSW_primality_test">Baillie–PSW primality test</a>, Wikipedia). According to <a rel="nofollow" class="external text" href="http://pari.math.u-bordeaux.fr/dochtml/html.stable/Arithmetic_functions.html">Arithmetic functions</a>, PARI/GP Home, if such a number exists, it must be larger than 2^64. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 22:48, 4 November 2014 (UTC)</li> <li> Primes p such that (p, p - 5) is an irregular pair. The only known instance of such a prime is 37 (see <a rel="nofollow" class="external text" href="http://dx.doi.org/10.1090/S0025-5718-1975-0376606-9">this paper</a>, page 114). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 22:26, 18 March 2015 (UTC)</li> <li> Primes p such that (p, p - 7) is an irregular pair. There is no known instance of such a prime (see <a rel="nofollow" class="external text" href="http://dx.doi.org/10.1090/S0025-5718-1975-0376606-9">this paper</a>, pages 114-115). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 22:26, 18 March 2015 (UTC)</li> <li> Superabundant numbers (<a href="http://oeis.org/A004394">A004394</a>) that are not Harshad numbers (<a href="http://oeis.org/A005349">A005349</a>). The only known term is 149602080797769600 (see <a rel="nofollow" class="external text" href="http://en.wikipedia.org/wiki/Superabundant_number">Superabundant number</a>, Wikipedia and the comment by T. D. Noe in <a href="http://oeis.org/A128702">A128702</a> from 2009-10-27). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 22:35, 18 March 2015 (UTC)</li> <li> Tribonacci-Wieferich primes. There is no known instance of such a prime (see J. Klaska, <a rel="nofollow" class="external text" href="http://www.fq.math.ca/Papers1/46_47-4/Klaska.pdf">On Tribonacci-Wieferich primes</a>, The Fibonacci Quarterly, Vol. 46/47, No. 4 (2008/2009), 290-297). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 19:33, 24 March 2015 (UTC)</li> <li> Tribonacci-Wieferich primes of the second kind. There is no known instance of such a prime (see J. Klaska, <a rel="nofollow" class="external text" href="http://dml.cz/bitstream/handle/10338.dmlcz/137497/ActaOstrav_16-2008-1_2.pdf">A search for Tribonacci-Wieferich primes</a>, Acta Mathematica Universitatis Ostraviensis, Vol. 16, No. 1 (2008), 15-20). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 19:33, 24 March 2015 (UTC)</li> <li> Primes p with B_{p-2}(1/3) == 0 (mod p), where B_n(x) denotes the Bernoulli polynomial of degree n. The only known term is 205129. Originally suggested as <a rel="nofollow" class="external text" href="http://oeis.org/history/view?seq=A252055&v=18">A252055</a>. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 21:58, 13 April 2015 (UTC)</li> <li> Numbers that are not Hansen numbers. The only known example is 5784689 (see N. M. Clift, <a rel="nofollow" class="external text" href="https://doi.org/10.1007/s00607-010-0118-8">Calculating optimal addition chains</a>, Computing, Vol. 91, No. 3 (2011), 265-284). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 20:14, 10 May 2015 (UTC)</li> <li> Minimal number of translation classes in which copies of a tile with Heesch number n can occur if as large a patch of tiles as possible is built from those copies (see <a rel="nofollow" class="external text" href="http://list.seqfan.eu/pipermail/seqfan/2015-May/014825.html">Heesch numbers</a>, Seqfan). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 14:34, 16 May 2015 (UTC)</li> <li> Number of n-dimensional convex uniform polytopes, excluding infinite sets. a(3) = 18, a(4) = 58. The value for a(4) was obtained by counting the distinct convex uniform 4-polytopes in Wikipedia, <a rel="nofollow" class="external text" href="https://en.wikipedia.org/wiki/Uniform_4-polytope">Uniform 4-polytope</a> <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 15:00, 16 May 2015 (UTC) [Value for a(4) updated. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> (<a href="/w/index.php?title=User_talk:Felix_Fr%C3%B6hlich&action=edit&redlink=1" class="new" title="User talk:Felix Fröhlich (page does not exist)">talk</a>) 05:53, 3 October 2018 (EDT)] <ol><li> The value for a(3) can perhaps be derived from the set apparently proved in J. Skilling, <a rel="nofollow" class="external text" href="https://doi.org/10.1098/rsta.1975.0022">The complete set of uniform polyhedra</a>, Philosophical Transactions of the Royal Society A, Vol. 278, No. 1278 (1975). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> (<a href="/w/index.php?title=User_talk:Felix_Fr%C3%B6hlich&action=edit&redlink=1" class="new" title="User talk:Felix Fröhlich (page does not exist)">talk</a>) 05:22, 3 October 2018 (EDT)</li></ol></li> <li> Minimal number of pieces into which a regular n-gon must be cut such that the pieces can be rearranged into a regular (n+1)-gon, starting at n = 3. The Wallace–Bolyai–Gerwien theorem ensures this is possible for any n >= 3 (see <a rel="nofollow" class="external text" href="http://en.wikipedia.org/wiki/Wallace–Bolyai–Gerwien_theorem">Wallace–Bolyai–Gerwien theorem</a>, Wikipedia). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 15:17, 16 May 2015 (UTC)</li> <li> Natural numbers n with n "feasible" partition(s). Only known terms are 1 and 72. Originally suggested as <a rel="nofollow" class="external text" href="http://oeis.org/history/view?seq=A254434&v=14">A254434</a>. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 12:24, 19 May 2015 (UTC)</li> <li> Kissing number of Platonic solids (in the order tetrahedron, cube, octahedron, dodecahedron, icosahedron). a(1) = 20, a(2) = 26, a(3) = ?, a(4) = 12, a(5) = ?. To a(1): Start with a single tetrahedron. Attach a tetrahedron to each face of the first tetrahedron (this gives 4 "kissing" tetrahedra). Then, from the dihedral angle of the tetrahedron (~ 70.53°) it is clear two more tetrahedra can be added to each edge of the original tetrahedron, so 6*2 = 12 additional "kissing" tetrahedra. Finally, one further tetrahedron can be added to each vertex of the original tetrahedron, which gives 4*1 = 4 additional tetrahedra. Thus alltogether there are 4 + 12 + 4 = 20 kissing tetrahedra. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 12:47, 19 May 2015 (UTC) <ol><li> The value of a(3) is perhaps given in D. G. Larman and C. Zong, <a rel="nofollow" class="external text" href="https://doi.org/10.1007/PL00009418">On the Kissing Numbers of Some Special Convex Bodies</a>, Discrete & Computational Geometry, Vol. 21, No. 2 (1999), 233-242. Can someone who has access to the paper check? <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 13:09, 15 May 2016 (UTC) <ol><li> The authors of the paper give the translative kissing number and the lattice kissing number of the octahedron, both of which are equal to 18. However, this value may not be the maximal Kissing number possible for the octahedron, as there may be a higher kissing number that is not translative or a lattice kissing number, if I understand the matter correctly. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> (<a href="/w/index.php?title=User_talk:Felix_Fr%C3%B6hlich&action=edit&redlink=1" class="new" title="User talk:Felix Fröhlich (page does not exist)">talk</a>) 03:45, 7 March 2018 (EST)</li></ol></li></ol></li> <li> a(n) = number of non-selfintersecting polydodecahedra with n cells such that any two such polydodecahedra remain invariant under rotations and/or reflections. The sequence (with offset 1) starts: 1, 1, 3 <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 14:03, 19 May 2015 (UTC)</li> <li> a(n) = number of non-selfintersecting polyicosahedra with n cells such that any two such polyicosahedra remain invariant under rotations and/or reflections. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 14:17, 19 May 2015 (UTC)</li> <li> a(n) = number of different room numberings such that the 'Cube' from the film 'Cube' is working (the rooms are assumed to be moving simultaneously for this sequence and how they move is irrelevant, so, only the positions before or after the move matter) and has exactly n trapped rooms. The cube consists of 26^3 rooms. A room is considered to be trapped if at least one of the three numbers is in <a href="http://oeis.org/A000961">A000961</a>, (i.e. <a href="http://oeis.org/A001221">A001221</a>(n) = 1). The rules for room movement are as specified in 'Burkard Polster, Marty Ross, Math Goes to the Movies, pp. 92-95 (ISBN 978-1-4214-0483-7 / 978-1-4214-0484-4)'. Obviously, the sequence is finite, with 17577 terms (with offset 0). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 14:49, 19 May 2015 (UTC)</li> <li> Triangle T(n, k) of members of smallest Wieferich n-cycle. A Wieferich n-cycle here is defined as an ordered set of primes p_1, p_2, ... p_i, where each prime is the smallest Wieferich prime in base equal to its predecessor. The triangle starts<br />2, 1093<br />3, 11, 71<br />The following PARI-program can compute the triangle:<br /><code>smallestwieftobase(n) = forprime(p=2, , if(Mod(n, p^2)^(p-1)==1, return(p)))</code><br /><code>wiefcyclelengthof(n) = i=1; b=smallestwieftobase(n); while(b!=n, b=smallestwieftobase(b); i++); return(i)<br />for(n=2, 10, forprime(q=2, , if(wiefcyclelengthof(q)==n, print1(q, ", "); j=n-1; while(j > 0, q=smallestwieftobase(q); print1(q, ", "); j--); print(""); break({1}))))</code> <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 20:14, 19 May 2015 (UTC)</li> <li> Minimum number of tiles in an aperiodic set of Wang hypercubes in dimension n (see <a rel="nofollow" class="external text" href="http://en.wikipedia.org/wiki/Wang_tile">Wang tile</a>, Wikipedia for an overview). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 20:58, 19 May 2015 (UTC) <ol><li> It seems now to be proven that a(2) = 11 (see E. Jeandel and M. Rao, <a rel="nofollow" class="external text" href="https://arxiv.org/abs/1506.06492">An aperiodic set of 11 Wang tiles</a>, arXiv:1506.06492). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> (<a href="/w/index.php?title=User_talk:Felix_Fr%C3%B6hlich&action=edit&redlink=1" class="new" title="User talk:Felix Fröhlich (page does not exist)">talk</a>) 08:46, 1 March 2018 (EST)</li></ol></li> <li> Numbers n such that <a href="http://oeis.org/A000292">A000292</a>(n) is a square. Only known terms are 0, 1, 2 and 48. Originally suggested as <a rel="nofollow" class="external text" href="http://oeis.org/history/view?seq=A256002&v=5">A256002</a>. Zak Seidov searched to 10^10 without finding another term. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 21:07, 16 June 2015 (UTC)</li> <li> Number of uniform honeycombs in n-dimensional hyperbolic space (<a rel="nofollow" class="external text" href="https://en.wikipedia.org/wiki/Uniform_honeycombs_in_hyperbolic_space">Uniform honeycombs in hyperbolic space</a>, Wikipedia). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 09:02, 7 August 2015 (UTC)</li> <li> Minimal number of colors needed in a set W consisting of n Wang tiles such that W is aperiodic (see <a rel="nofollow" class="external text" href="http://en.wikipedia.org/wiki/Wang_tile">Wang tile</a>, Wikipedia for an overview). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 09:06, 7 August 2015 (UTC) <ol><li> It seems now to be proven that a(11) = 4 and that a(n) does not exist for n < 11 (see E. Jeandel and M. Rao, <a rel="nofollow" class="external text" href="https://arxiv.org/abs/1506.06492">An aperiodic set of 11 Wang tiles</a>, arXiv:1506.06492). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> (<a href="/w/index.php?title=User_talk:Felix_Fr%C3%B6hlich&action=edit&redlink=1" class="new" title="User talk:Felix Fröhlich (page does not exist)">talk</a>) 08:46, 1 March 2018 (EST)</li></ol></li> <li> Number of ways of placing n nonattacking rooks on a hexagonal board with edge-length n in Glinskis hexagonal chess (see <a rel="nofollow" class="external text" href="https://en.wikipedia.org/wiki/Hexagonal_chess#Gli.C5.84ski.27s_hexagonal_chess">Gliński's hexagonal chess</a>, Wikipedia). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 13:39, 18 October 2015 (UTC)</li> <li> Number of ways of placing n nonattacking bishops on a hexagonal board with edge-length n in Glinskis hexagonal chess (see <a rel="nofollow" class="external text" href="https://en.wikipedia.org/wiki/Hexagonal_chess#Gli.C5.84ski.27s_hexagonal_chess">Gliński's hexagonal chess</a>, Wikipedia). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 13:39, 18 October 2015 (UTC)</li> <li> Number of ways of placing n nonattacking queens on a hexagonal board with edge-length n in Glinskis hexagonal chess (see <a rel="nofollow" class="external text" href="https://en.wikipedia.org/wiki/Hexagonal_chess#Gli.C5.84ski.27s_hexagonal_chess">Gliński's hexagonal chess</a>, Wikipedia). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 13:39, 18 October 2015 (UTC)</li> <li> Number of ways of placing n nonattacking knights on a hexagonal board with edge-length n in Glinskis hexagonal chess (see <a rel="nofollow" class="external text" href="https://en.wikipedia.org/wiki/Hexagonal_chess#Gli.C5.84ski.27s_hexagonal_chess">Gliński's hexagonal chess</a>, Wikipedia). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 13:39, 18 October 2015 (UTC)</li> <li> Number of ways of placing n nonattacking kings on a hexagonal board with edge-length n in Glinskis hexagonal chess (see <a rel="nofollow" class="external text" href="https://en.wikipedia.org/wiki/Hexagonal_chess#Gli.C5.84ski.27s_hexagonal_chess">Gliński's hexagonal chess</a>, Wikipedia). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 13:39, 18 October 2015 (UTC)</li> <li> Triangle T(n, k) of number of spheres of radius k for k = 1, 2, 3, ..., n that can simultaneously touch a central sphere of radius n, read by rows. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 16:25, 8 January 2016 (UTC)</li> <li> Minimal number of additional convex tiles required such that the n-th Platonic polyhedron can tile Euclidean 3-space, in the order tetrahedron, cube, octahedron, dodecahedron, icosahedron. a(1) = 1, because the tetrahedron tessellates space with the octahedron in the tetrahedral-octahedral honeycomb, a(2) = 0, because the cube is a space-filling polyhedron, a(3) = 1, because of tetrahedral-octahedral honeycomb, a(4) = ?, a(5) = ?. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 16:30, 8 January 2016 (UTC)</li> <li> Number of regular compounds of regular polytopes in n dimensions. Originally suggested as <a rel="nofollow" class="external text" href="https://oeis.org/history/view?seq=A266814&v=5">A266814</a>. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 10:50, 10 January 2016 (UTC)</li> <li> Number of hermitian indecomposable unimodular lattices over the ring of Eisenstein integers of dimension n. Apparently, a(8) = 720 (cf. (C), table 1), a(9) = 648 (cf. (C), table 1), a(10) = 540 (cf. (C), table 1), a(11) = 396 (cf. (C), table 1), a(13) = 14 (cf. (B)), a(14) = 58 (cf. (A), theorem 1), a(15) = 259 (cf. (A), theorem 2) <a rel="nofollow" class="external text" href="http://dx.doi.org/10.1090/S0025-5718-08-02131-5">(A)</a> <a rel="nofollow" class="external text" href="http://dx.doi.org/10.1016/j.jalgebra.2003.05.006">(B)</a> <a rel="nofollow" class="external text" href="http://dx.doi.org/10.1016/0021-8693(78)90273-9">(C)</a>. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 11:31, 13 February 2016 (UTC) <ol><li> I might have misread something. According to <a rel="nofollow" class="external text" href="https://www.mfo.de/document/0501/OWR_2005_01.pdf">Gitter und Anwendungen</a>, Report No. 1/2005, Mathematisches Forschungsinstitut Oberwolfach, K. Abdukhalikov, Unimodular Hermitian lattices, p. 27-30, a(1) = a(6) = a(8) = a(9) = 1, a(10) = a(11) = 2, a(12) = 11, a(13) = 14, a(14) = 58, a(15) = 259. Some of the missing values might be given in reference [7] listed in that paper. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 15:54, 21 May 2016 (UTC)</li></ol></li> <li> Primes that are not good. The only known term less than 10^8 is 23 (see D. M. Davis, <a rel="nofollow" class="external text" href="http://www.lehigh.edu/dmd1/public/www-data/define3.pdf">For which p-adic integers x can sum_{k}binomial(x, k)^-1 be defined?</a>, p. 2). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 20:55, 17 May 2016 (UTC)</li> <li> omega(2^(2^p-1)-1) for p = <a href="http://oeis.org/A000043">A000043</a>(n), i.e., a(n) = <a href="http://oeis.org/A001221">A001221</a>(<a href="http://oeis.org/A000225">A000225</a>(<a href="http://oeis.org/A000668">A000668</a>(n))). a(1)-a(4) are 1, 1, 1, 1. a(5) is at least 2 according to <a rel="nofollow" class="external text" href="http://www.doublemersennes.org/factors.php">Found factors</a>, Double Mersennes Prime Search. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 14:51, 3 June 2016 (UTC)</li> <li> Numbers n such that 2^n-1 is a semiprime and at least one of the two prime factors p and q satisfies p^2 =/= 1 (mod n) or q^2 =/= 1 (mod n) (see <a rel="nofollow" class="external text" href="http://math.stackexchange.com/q/645467">this question</a> at Mathematics Stack Exchange). Greg Martin at MSE states he searched to n = 200 and found only two cases: 9 and 49. I extended the search to 292 without finding another term using the following PARI code: <code>is(n) = my(t=2^n-1); if(bigomega(t)==2, my(p=factor(t)[1, 1], q=factor(t)[omega(t), 1]); if(Mod(p^2, n)==1 && Mod(q^2, n)==1, return(0), return(1)))</code>. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 13:24, 21 June 2016 (UTC)</li> <li> Integers z such that x^3 + y^5 = z^7 has a solution for x, y, z > 0. Known terms are 8192 and 268435456. Originally suggested as <a rel="nofollow" class="external text" href="http://oeis.org/history/view?seq=A273913&v=11">A273913</a>. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 20:58, 6 July 2016 (UTC)</li> <li> Elliptic Carmichael numbers. The smallest term is 617730918224831720922772642603971311. See <a rel="nofollow" class="external text" href="https://arxiv.org/abs/1609.00231">arXiv:1609.00231</a>. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 11:17, 13 August 2017 (UTC)</li></ol> <h3><span class="mw-headline" id="Done_requests">Done requests</span></h3> <p>If any of the above requested sequences have been created, please move the entry of the request (including any discussion) to this section and provide a link to the created sequence entry in the database. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 20:35, 20 May 2015 (UTC) </p> <ol><li> <a href="http://oeis.org/A249275">A249275</a>: Smallest a such that prime p satisfies a^(p-1) == 1 (mod p^3) (<a rel="nofollow" class="external autonumber" href="http://dx.doi.org/10.1090/S0025-5718-04-01666-7">[1]</a> see page 929) <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 07:26, 14 September 2014 (UTC)</li> <li> <a href="http://oeis.org/A275338">A275338</a>: Smallest prime p such that some base b with 1 < b < p exists for which p satisfies b^(p-1) == 1 (mod p^n), i.e., smallest p = prime(i) such that <a href="http://oeis.org/A254444">A254444</a>(i) == n. Sequence (with offset 2) starts 11, 113 <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 14:17, 19 May 2015 (UTC)</li> <li> <a href="http://oeis.org/A275773">A275773</a>: Counterexamples mentioned in comment from Bruno Berselli in <a href="http://oeis.org/A059245">A059245</a>: Primes congruent to 1 modulo 13 such that x^13 = 2 has a solution modulo p. a(1) = 4421. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 15:54, 8 January 2016 (UTC)</li> <li> <a href="http://oeis.org/A283449">A283449</a>: Smallest composite that is not an n-th power, but can be written as the sum of the n-th powers of two or more of its prime factors. a(7) = 275223438741 (cf. <a href="http://oeis.org/A257659">A257659</a>). <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 15:45, 8 January 2016 (UTC)</li> <li> <a href="http://oeis.org/A309442">A309442</a>: The analogue of <a href="http://oeis.org/A244951">A244951</a> in four dimensions, i.e., the minimum number of colors needed to color the cells (facets) of the six Platonic 4-polytopes such that no two cells meeting at a common "ridge" share the same color. <a href="/wiki/User:Felix_Fr%C3%B6hlich" title="User:Felix Fröhlich">Felix Fröhlich</a> 14:03, 19 May 2015 (UTC)</li></ol> <h2><span class="mw-headline" id="Other">Other</span></h2> <ol><li> Should journal and book titles in the CiteA, CiteB, ... CiteZ pages be italicized? — <a href="/wiki/User:Alonso_del_Arte" title="User:Alonso del Arte">Alonso del Arte</a> 15:56, 29 November 2011 (UTC)</li></ol> <p>Answer: I am continually adding items to the Cites pages. Each change calls for 4 clicks (preview,save,submit,approve), and each click takes several seconds. It is very slow work. Furthermore, I use the same line that I have typed when I add the work to the appropriate sequences in the OEIS entries. So I try to keep things as simple as possible. The line that I type has to work both on the wiki side, where the language is MediaWiki, and on the OEIS side, where the language is basically html, or plain text. So the answer to your question is, if you want to do it, go ahead. But I don't have time! N. J. A. Sloane, Oct 8, 2013. </p> <dl><dd>Alright, I'll try to do it for CiteA tomorrow. <a href="/wiki/User:Alonso_del_Arte" title="User:Alonso del Arte">Alonso del Arte</a> 03:44, 25 August 2014 (UTC)</dd></dl> <h2><span class="mw-headline" id="Done">Done</span></h2> <ol><li> (Done) Make the following replacements wherever the to-be-replaced string appears in an Author (%A) record of the database. Thanks! - <a href="/wiki/User:Jon_E._Schoenfield" title="User:Jon E. Schoenfield">Jon E. Schoenfield</a> 01:24, 23 February 2015 (UTC) <ol><li> "Donald S. McDonald (don.mcdonald(AT)paradise.net.nz)" -> "_Donald S. McDonald_" (none of these)</li> <li> "Donald S McDonald (don.mcdonald(AT)paradise.net.nz)" -> "_Donald S. McDonald_" (none of these)</li> <li> "Randy L. Ekl (Randy.Ekl(AT)Motorola.com)" -> "_Randy L. Ekl_"</li> <li> "R. H. Barbour (bbarbour(AT)unitec.ac.nz)" -> "_Robert H Barbour_"</li> <li>"Thomas Zaslavsky (zaslav(AT)math.binghamton.edu)" -> "_Thomas Zaslavsky_"</li></ol></li> <li> (Done) Doublecheck numeric tables in <a href="/wiki/Benford%27s_law#Prime_numbers_and_Benford.27s_law" title="Benford's law">Benford's law#Prime numbers and Benford's law</a>. In regards to 1, the results are as I expected, but I'm doubting myself on 5, 6, 7. <a href="/wiki/User:Alonso_del_Arte" title="User:Alonso del Arte">Alonso del Arte</a> 03:44, 25 August 2014 (UTC)</li> <li> (Done) Replace "O. E. Pol" by "Omar E. Pol". Thanks in advance! - <a href="/wiki/User:Omar_E._Pol" title="User:Omar E. Pol">Omar E. Pol</a> 14:30, 9 January 2014 (UTC) <dl><dd> <a rel="nofollow" class="external text" href="https://oeis.org/search?q=o-e-pol+-ref%3Ao-e-pol+-link%3Ao-e-pol&">Seems done everywhere(?) except in REFS/LINKS</a> where using only initials is the standard. <small>— <a href="/wiki/User_talk:M._F._Hasler" title="User talk:M. F. Hasler">MFH</a></small> 23:15, 9 March 2014 (UTC) </dd></dl></li> <li> (Done) Replace "__Leroy Quet__" with "_Leroy Quet_". Thanks! - <a href="/wiki/User:Jon_E._Schoenfield" title="User:Jon E. Schoenfield">Jon E. Schoenfield</a> 02:02, 11 February 2014 (UTC)</li> <li> (Done) Replace geocities.com URL's or mark them with [broken link?] - <a href="/wiki/User:R._J._Mathar" title="User:R. J. Mathar">R. J. Mathar</a> 09:51, 11 July 2013 (UTC)</li> <li> (Done) Replace "outer shell" by "last section", except in the entry <a href="http://oeis.org/A173592">A173592</a>. There are 44 sequences that contain this phrase. Thanks in advance! <a href="/wiki/User:Omar_E._Pol" title="User:Omar E. Pol">Omar E. Pol</a> 13:10, 1 December 2013 (UTC) <ol><li> Completed the change with "outer shell" and "outer shells" then reverted <a href="http://oeis.org/A173592">A173592</a>. The global replacement system isn't particularly flexible... <a href="/wiki/User:Charles_R_Greathouse_IV" title="User:Charles R Greathouse IV">Charles R Greathouse IV</a> 18:39, 1 December 2013 (UTC)</li></ol></li> <li> (Done) Request the deTeXification of "Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures". Search finds it 612 times. <a href="/wiki/User:Peter_Luschny" title="User:Peter Luschny">Peter Luschny</a> 21:22, 17 November 2013 (UTC)</li> <li> (Done) Request the deTeXification of "Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al". Search finds it 628 times. <a href="/wiki/User:Peter_Luschny" title="User:Peter Luschny">Peter Luschny</a> 23:19, 16 November 2013 (UTC)</li> <li> (Done) Replace "outer shell of the partitions" by "last section of the set of partitions". There are 74 sequences that contain this phrase. Thanks in advance! <a href="/wiki/User:Omar_E._Pol" title="User:Omar E. Pol">Omar E. Pol</a> 11:46, 30 November 2013 (UTC)</li> <li> (Done) Request the following global replacements (each of which, the last time I checked, would cover 10 or more places in the OEIS). Thanks! <a href="/wiki/User:Jon_E._Schoenfield" title="User:Jon E. Schoenfield">Jon E. Schoenfield</a> 05:09, 10 October 2013 (UTC) <ol><li> "Roberto E. Martinez II (remartin(AT)fas.harvard.edu)" -> "_Roberto E. Martinez II_"</li> <li> "Owen Whitby (whitbyo(AT)acm.org)" -> "_Owen Whitby_"</li> <li> "Tomaz Pisanski (Tomaz.Pisanski(AT)fmf.uni-lj.si)" -> "_Tomaz Pisanski_"</li> <li> "T. D. Noe (noe@sspectra.com)" -> "_T. D. Noe_"</li> <li> "Pierre CAMI (colettecami(AT)aol.com)" -> "_Pierre CAMI_"</li> <li> "Frans Faase (Frans_LiXia(AT)wxs.nl)" -> "_Frans J. Faase_"</li> <li> "Rob Pratt (Rob.Pratt(AT)sas.com)" -> "_Rob Pratt_"</li> <li> "Robert W. Pratt (Rob.Pratt(AT)sas.com)" -> "_Rob Pratt_"</li> <li> "Howard A. Landman (howard(AT)polyamory.org)" -> "_Howard A. Landman_"</li> <li> "Stephen Crowley (crow(AT)crowlogic.net)" -> "_Stephen Crowley_"</li> <li> "Richard Sabey (richardsabey(AT)hotmail.co.uk)" -> "_Richard Sabey_"</li> <li> "Olaf Voss (richyfourtythree(AT)yahoo.com)" -> "_Olaf Voß_"</li> <li> "Greg Huber huber(AT)alum.mit.edu" -> "_Greg Huber_"</li> <li> "Jim Propp (propp(AT)math.wisc.edu)" -> "_James Propp_"</li> <li> "Leonid Broukhis (leo(AT)mailcom.com)" -> "_Leonid Broukhis_"</li> <li> "Neville Holmes (neville.holmes(AT)utas.edu.au)" -> "_W. Neville Holmes_"</li> <li> "Jonathan D. B. Hodgson (hodgsonjdb(AT)btinternet.com)" -> "_Jonathan D. B. Hodgson_"</li> <li> "Leonid Broukhis (leob(AT)mailcom.com)" -> "_Leonid Broukhis_"</li> <li> "Ignacio Larrosa Canestro (ignacio.larrosa(AT)eresmas.net)" -> "_Ignacio Larrosa Cañestro_"</li> <li> "Ross Drewe (rd(AT)labyrinth.net.au)" -> "_Ross Drewe_"</li> <li> "Dann Toliver (fsdrt(AT)hotmail.com)" -> "_Dann Toliver_"</li> <li> "_Mohammad K. Azarian_, azarian(AT)evansville.edu" -> "_Mohammad K. Azarian_"</li> <li> "Joel Lewis (jblewis(AT)fas.harvard.edu)" -> "_Joel B. Lewis_"</li> <li> "James East (jameseastseq(AT)hotmail.com)" -> "_James East_"</li> <li> "Vassilis Papadimitriou (bpapa(AT)sch.gr)" -> "_Vassilis Papadimitriou_"</li> <li> "Paul Lusch (plusch(AT)flash.net)" -> "_Paul Lusch_"</li></ol> <dl><dd> Done. <a href="/wiki/User:Charles_R_Greathouse_IV" title="User:Charles R Greathouse IV">Charles R Greathouse IV</a> 19:33, 12 October 2013 (UTC)</dd></dl></li> <li> (Done) Request the following global edits. Thanks! <a href="/wiki/User:Jon_E._Schoenfield" title="User:Jon E. Schoenfield">Jon E. Schoenfield</a> 18:37, 4 October 2013 (UTC) <ol><li> change "Andre F. Labossiere (boronali(AT)laposte.net)" to "_André F. Labossière_"</li> <li> change "Bodo Zinser (BodoZinser(AT)Compuserve.com)" to "_Bodo Zinser_"</li> <li> change "Bodo Zinser (BodoZinser(AT)CosmoData.net)" to "_Bodo Zinser_"</li> <li> change "Henri Lifchitz 100637.64(AT)CompuServe.COM" to "_Henri Lifchitz_"</li> <li> change "Kailasam Viswanathan Iyer (kvi(AT)nitt.edu)" to "_K.V.Iyer_"</li> <li> change "Sam Alexander (amnalexander(AT)yahoo.com)" to "_Sam Alexander_"</li> <li> change "Soren Eilers (eilers(AT)math.ku.dk)" to "_Søren Eilers_"</li></ol></li> <li> (Done) Go through the ~100 sequences in <span class="plainlinks"><a rel="nofollow" class="external text" href="http://oeis.org/search?q=palindromic+primes+-keyword%3Abase">palindromic primes -keyword:base</a></span> and give keyword:base to all appropriate sequences. <dl><dd> About half needed the keyword. <a href="/wiki/User:Charles_R_Greathouse_IV" title="User:Charles R Greathouse IV">Charles R Greathouse IV</a> 14:19, 3 October 2013 (UTC)</dd></dl></li> <li> (Done) Go through the 500+ sequences returned by searching for the email address "rpropper(AT)stanford.edu" and replace "Ryan Propper (rpropper(AT)stanford.edu)" with _Ryan Propper_; make similar changes to remove email addresses of registered users Shyam Sunder Gupta (guptass(AT)rediffmail.com), Washington Bomfim (webonfim(AT)bol.com), Augustine O. Munagi (amunagi(AT)yahoo.com), Jud McCranie (JudMcCranie(AT)ugaalum.uga.edu), Omar E. Pol (info(AT)polprimos.com), Mike Oakes (Mikeoakes2(AT)aol.com), Robert Gerbicz (gerbicz(AT)freemail.hu), Gene Ward Smith (genewardsmith(AT)gmail.com), Fred Schneider (frederick.william.schneider(AT)gmail.com), Ed Pegg Jr (ed(AT)mathpuzzle.com), and Clark Kimberling (ck6(AT)evansville.edu).</li> <li> (Done) Request the following global edits: <ol><li> change "Michael Joseph Halm (hierogamous(AT)lycos.com)" to "_Michael Joseph Halm_"</li> <li> change "Howard A. Landman (howard(AT)riverrock.org)" to "_Howard A. Landman_"</li> <li> change "R. H. Hardin rhh(at)cadence.com" to "_R. H. Hardin_"</li> <li> change "Brendan McKay (bdm(at)cs.anu.edu.au)" to "_Brendan McKay_"</li> <li> change "A. O. Munagi (amunagi(AT)yahoo.com)" to "_Augustine O. Munagi_"</li> <li> change "Shyam Sunder Gupta (guptass(AT)rediffmail.com)" to "_Shyam Sunder Gupta_"</li> <li> change "Ryan Propper (rpropper(AT)stanford.edu)" to "_Ryan Propper_"</li> <li> change "Jasinski Artur (grafix(AT)csl.pl)" to "_Artur Jasinski_"</li> <li> change "Artur Jasinski with assistance from Bob Hanlon (grafix(AT)csl.pl)" to "_Artur Jasinski_ with assistance from Bob Hanlon"</li> <li> change "Santi Spadaro (spados(AT)katamail.com)" to "_Santi Spadaro_"</li> <li> change "J. Lowell, jhbubby(AT)mindspring.com" to "_J. Lowell_"</li></ol> <dl><dd> thanks! <a href="/wiki/User:Jon_E._Schoenfield" title="User:Jon E. Schoenfield">Jon E. Schoenfield</a> 02:54, 3 October 2013 (UTC)</dd></dl></li> <li> (DONE) Change each of the ~83 sequences that contain the string "Diana Mecum (diana.mecum(AT)gmail.com)" and replace it with "_Diana L. Mecum_" (I'm assuming they're the same individual!). -- Jon E. Schoenfield, Sep 23 2013.</li> <li> (Done) Assuming that the email address and registered username in each of the following pairs is for the same individual, replace the existing name string (spellings may vary!) and existing email address with the registered username. -- Jon E. Schoenfield, Sep 23 2013. <ol><li> "cjsalves(AT)gmail.com" / "_Carlos Alves_"</li> <li> "rpropper(AT)cs.stanford.edu" / "_Ryan Propper_"</li> <li> "drew(AT)math.mit.edu" / "_Andrew V. Sutherland_"</li> <li> "xordan.tom(AT)gmail.com" / "_Tomas Xordan_"</li> <li> "rohelakhan(AT)yahoo.com" / "_Sameen Ahmed Khan_"</li> <li> "alonso.delarte(AT)gmail.com" / "_Alonso del Arte_"</li> <li> "olivier.gerard(AT)gmail.com" / "_Olivier Gérard_"</li></ol></li> <li> (Done) Please replace everywhere: <dl><dd> <a rel="nofollow" class="external free" href="http://babelfish.yahoo.com/translate_url?trurl=http%3A%2F%2Fdxdy.ru%2Ftopic1165.html&lp=ru_en">http://babelfish.yahoo.com/translate_url?trurl=http%3A%2F%2Fdxdy.ru%2Ftopic1165.html&lp=ru_en</a> </dd> <dd> with</dd> <dd> <a rel="nofollow" class="external free" href="http://translate.google.com/translate?hl=en&sl=ru&tl=en&u=http%3A%2F%2Fdxdy.ru%2Ftopic1165.html">http://translate.google.com/translate?hl=en&sl=ru&tl=en&u=http%3A%2F%2Fdxdy.ru%2Ftopic1165.html</a></dd> <dd> Thanks! <a href="/wiki/User:Max_Alekseyev" title="User:Max Alekseyev">Max Alekseyev</a> 01:28, 27 September 2013 (UTC)</dd></dl></li> <li> (Done) Repair links to SeqFan threads as announced in <a rel="nofollow" class="external text" href="http://list.seqfan.eu/pipermail/seqfan/2012-July/009776.html">Re: Early SeqFan archives</a> — <a href="/wiki/User:R._J._Mathar" title="User:R. J. Mathar">R. J. Mathar</a> 18:04, 4 January 2013 (UTC)</li> <li> (Done) Replace "Vladeta Jovovic (vladeta(AT)eunet.yu)" by "_Vladeta Jovovic_" — <a href="/wiki/User:Joerg_Arndt" title="User:Joerg Arndt">Joerg Arndt</a> 13:58, 21 May 2013 (UTC)</li> <li> (Done) Replace "Frank Ruskey, Nate Kube (ruskey(AT)cs.uvic.ca)" by "_Frank Ruskey_ and Nate Kube" . <a href="/wiki/User:R._J._Mathar" title="User:R. J. Mathar">R. J. Mathar</a> 14:13, 9 May 2013 (UTC)</li> <li> (Done) Replace the names "A simple regular expression in a labeled universe" by more specific ones. — <a href="/wiki/User:R._J._Mathar" title="User:R. J. Mathar">R. J. Mathar</a> 21:24, 17 November 2011 (UTC)</li> <li> (Done) The paper V. Jelinek, T. Mansour and M. Shattuck, On multiple pattern avoiding set partitions, Advances in Applied Mathematics Volume 50, Issue 2, February 2013, Pages 292-326 (I have a copy), contains a number of generating functions (See Theorems 4.1, 4.2, Ex. 4.16 (3), 4.17 (2), Prop. 4.20, 4.21, 4.23, 4.27, and maybe others). Could someone produce the sequences corresponding to these g.f.'s and add them to the OEIS if they are new, or add references to this paper if they are already in the OEIS? - N. J. A. Sloane, 1 January 2013. <a href="http://en.wikipedia.org/wiki/Digital_object_identifier" class="extiw" title="wikipedia:Digital object identifier"><span style="border-bottom: 1px dotted #999" title="digital object identifier">doi</span></a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1016%2Fj.aam.2012.09.002">10.1016/j.aam.2012.09.002</a>, Theorem 4.1=<a href="http://oeis.org/A025242">A025242</a>. Theorem 4.2=<a href="http://oeis.org/A005773">A005773</a>. Ex. 4.16=<a href="http://oeis.org/A005183">A005183</a> and <a href="http://oeis.org/A116701">A116701</a>, but H1121 gives negative terms (incorrect), L1121 =<a href="http://oeis.org/A209230">A209230</a> (new, sign corrected). L_{1232}=<a href="http://oeis.org/A005183">A005183</a>, same as proposition 4.20. Lemma 4.21=essentially <a href="http://oeis.org/A132750">A132750</a>. <a href="/wiki/User:R._J._Mathar" title="User:R. J. Mathar">R. J. Mathar</a> 21:42, 12 January 2013 (UTC)</li> <li> (Done) Replace <a rel="nofollow" class="external free" href="http://algo.inria.fr/csolve">http://algo.inria.fr/csolve</a> by <a rel="nofollow" class="external free" href="http://www.people.fas.harvard.edu/~sfinch/csolve">http://www.people.fas.harvard.edu/~sfinch/csolve</a> . <a href="/wiki/User:R._J._Mathar" title="User:R. J. Mathar">R. J. Mathar</a> 18:15, 8 January 2013 (UTC)</li> <li> (Done) Apparently the book M. Pitici, editor, The Best Writing on Mathematics, Princeton Univ. Press, 2012 mentions the OEIS - can someone tell me in which chapter, page numbers, etc.? - N. J. A. Sloane, Jan 02 2013</li> <li> (Done) Repair references to arxiv esp. by E. Deutsch: already fixed ~ 25 occurrences of "arxiv1111...." to "arxiv:1111..." by hand, but there are about 30 left (cf. <a rel="nofollow" class="external free" href="https://oeis.org/search?q=arXiv1111&fmt=short">https://oeis.org/search?q=arXiv1111&fmt=short</a>), and most probably others (not only(?) from the same submitter). — <a href="/wiki/User:M._F._Hasler" title="User:M. F. Hasler">M. F. Hasler</a> 18:37, 6 January 2013 (UTC) <dl><dd> I corrected all 26 cases, plus two similar ones I found. <a href="/wiki/User:Charles_R_Greathouse_IV" title="User:Charles R Greathouse IV">Charles R Greathouse IV</a> 18:10, 7 January 2013 (UTC)</dd></dl></li> <li> (Done) Apparently this paper: Keisuke Nakano, Shall We Juggle, Coinductively?, in Certified Programs and Proofs, Lecture Notes in Computer Science Volume 7679, 2012, pp 160-172, DOI 10.1007/978-3-642-35308-6_14 mentions the OEIS and probably has one or more new sequences in it - does anyone have access to a copy? - N. J. A. Sloane, Jan 02 2013</li> <li> (Done) Insert b-files at the top of the "links" field. If possible automatically move b-file links that are not at the top to the top. - <a href="/wiki/User:Joerg_Arndt" title="User:Joerg Arndt">Joerg Arndt</a> 12:27, 25 April 2013 (UTC) <dl><dd> Russ Cox revised program on Aug 12 2014 to take care of this for b-files. Thanks, Russ! Ray Chandler, Aug 24 2014.</dd></dl></li></ol> <p>See <a href="/wiki/Suggested_Projects/Archive" title="Suggested Projects/Archive">Suggested Projects/Archive</a> for projects completed earlier. </p> <h2><span class="mw-headline" id="Not_done">Not done</span></h2> <ol><li> Reducing all (or most) <a href="/wiki/B-files" title="B-files">b-files</a> to the standard size (10000?). [From Moshe Levin] <dl><dd> I strongly disagree. The b-files should never be shortened. — N. J. A. Sloane, Oct 25 2011 <dl><dd> Maybe extending when possible b-files to a thousand or ten thousand terms (as recently happened with <a href="http://oeis.org/A065449">A065449</a> with a b-file that went up to 466, so Charles extended it to 1000. [From <a href="/wiki/User:Alonso_del_Arte" title="User:Alonso del Arte">Alonso del Arte</a> 20:02, 24 October 2011 (UTC)] <dl><dd> This has been discussed earlier, see also <a rel="nofollow" class="external free" href="http://oeis.org/wiki/User_talk:M._F._Hasler/dynamic_content#The_basic_idea">http://oeis.org/wiki/User_talk:M._F._Hasler/dynamic_content#The_basic_idea</a>: If there is an excessively large b-file, it would indeed be useful to have b-file(s) of handier size, which could be created by the server (either physically as a file or virtually/dynamically "upon request"), by simply truncating the existing one. — <a href="/wiki/User:Maximilian_F._Hasler" class="mw-redirect" title="User:Maximilian F. Hasler">M. F. Hasler</a> 19:59, 24 October 2011 (UTC)</dd></dl></dd></dl></dd></dl></li> <li> Add a link from <a rel="nofollow" class="external free" href="https://oeis.org">https://oeis.org</a> to <a rel="nofollow" class="external free" href="http://list.seqfan.eu/pipermail/seqfan">http://list.seqfan.eu/pipermail/seqfan</a> . Add a link from <a rel="nofollow" class="external free" href="https://oeis.org/draft">https://oeis.org/draft</a> to <a rel="nofollow" class="external free" href="http://list.seqfan.eu/pipermail/seqfan">http://list.seqfan.eu/pipermail/seqfan</a> . Add a link from <a rel="nofollow" class="external free" href="https://oeis.org/draft/editing">https://oeis.org/draft/editing</a> to <a rel="nofollow" class="external free" href="http://list.seqfan.eu/pipermail/seqfan">http://list.seqfan.eu/pipermail/seqfan</a> . - <a href="/wiki/User:Omar_E._Pol" title="User:Omar E. Pol">Omar E. Pol</a> 12:15, 1 May 2014 (UTC) Why? Bookmarks exist. - <a href="/wiki/User:Joerg_Arndt" title="User:Joerg Arndt">Joerg Arndt</a> 12:25, 30 June 2014 (UTC)</li></ol> <h2><span class="mw-headline" id="See_also">See also</span></h2> <ul><li> <a href="/wiki/Future_Projects" title="Future Projects">Future Projects</a></li> <li> <a href="/wiki/ToDo" title="ToDo">ToDo</a></li> <li> <a href="/wiki/Main_Page/Prototype" title="Main Page/Prototype">Main Page/Prototype</a></li></ul>   </div>  </div><div class="printfooter"> Retrieved from "<a dir="ltr" href="https://oeis.org/w/index.php?title=Suggested_Projects&oldid=1662629">https://oeis.org/w/index.php?title=Suggested_Projects&oldid=1662629</a>"</div> <div id="catlinks" class="catlinks" data-mw="interface"><div id="mw-normal-catlinks" class="mw-normal-catlinks"><a href="/wiki/Special:Categories" title="Special:Categories">Categories</a>: <ul><li><a href="/wiki/Category:Suggested_Projects" title="Category:Suggested Projects">Suggested Projects</a></li><li><a href="/wiki/Category:To-do_lists" title="Category:To-do lists">To-do lists</a></li></ul></div></div>  <div class="visualClear"></div> </div> </div> </div> <div id="column-one"> <h2>Navigation menu</h2> <div id="p-cactions" class="portlet" role="navigation"> <h3>Views</h3> <div class="pBody"> <ul> <li id="ca-nstab-main" class="selected"><a href="/wiki/Suggested_Projects" title="View the content page [c]" accesskey="c">Page</a></li> <li id="ca-talk"><a href="/wiki/Talk:Suggested_Projects" rel="discussion" title="Discussion about the content page [t]" accesskey="t">Discussion</a></li> <li id="ca-viewsource"><a href="/w/index.php?title=Suggested_Projects&action=edit" title="This page is protected.
You can view its source [e]" accesskey="e">View source</a></li> <li id="ca-history"><a href="/w/index.php?title=Suggested_Projects&action=history" title="Past revisions of this page [h]" accesskey="h">History</a></li> </ul> </div> </div> <div class="portlet" id="p-personal" role="navigation"> <h3>Personal tools</h3> <div class="pBody"> <ul> <li id="pt-login"><a href="/w/index.php?title=Special:UserLogin&returnto=Suggested+Projects" title="You are encouraged to log in; however, it is not mandatory [o]" accesskey="o">Log in</a></li> <li id="pt-createaccount"><a href="/wiki/Special:RequestAccount" title="You are encouraged to create an account and log in; however, it is not mandatory">Request account</a></li> </ul> </div> </div> <div class="portlet" id="p-logo" role="banner"> <a href="/wiki/Main_Page" class="mw-wiki-logo" title="Visit the main page"></a> </div> <div class="generated-sidebar portlet" id="p-navigation" role="navigation"> <h3>Navigation</h3> <div class="pBody"> <ul> <li id="n-OEIS"><a href="http://oeis.org/">OEIS</a></li> <li id="n-mainpage-description"><a href="/wiki/Main_Page" title="Visit the main page [z]" accesskey="z">Wiki Main Page</a></li> <li id="n-portal"><a href="/wiki/OeisWiki:Community_portal" title="About the project, what you can do, where to find things">Community portal</a></li> <li id="n-status"><a href="/wiki/OeisWiki:System_Status">System Status</a></li> <li id="n-recentchanges"><a href="/wiki/Special:RecentChanges" title="A list of recent changes in the wiki [r]" accesskey="r">Recent changes</a></li> <li id="n-randompage"><a href="/wiki/Special:Random" title="Load a random page [x]" accesskey="x">Random page</a></li> <li id="n-help"><a href="https://www.mediawiki.org/wiki/Special:MyLanguage/Help:Contents" title="The place to find out">Help</a></li> </ul> </div> </div> <div id="p-search" class="portlet" role="search"> <h3><label for="searchInput">Search</label></h3> <div id="searchBody" class="pBody"> <form action="/w/index.php" id="searchform"> <input type="hidden" name="title" value="Special:Search"/> <input type="search" name="search" placeholder="Search OeisWiki" title="Search OeisWiki [f]" accesskey="f" id="searchInput"/> <input type="submit" name="go" value="Go" title="Go to a page with this exact name if it exists" id="searchGoButton" class="searchButton"/> <div><a href="/wiki/Special:Search" rel="search">Advanced search</a></div> </form> </div> </div> <div class="portlet" id="p-tb" role="navigation"> <h3>Tools</h3> <div class="pBody"> <ul> <li id="t-whatlinkshere"><a href="/wiki/Special:WhatLinksHere/Suggested_Projects" title="A list of all wiki pages that link here [j]" accesskey="j">What links here</a></li> <li id="t-recentchangeslinked"><a href="/wiki/Special:RecentChangesLinked/Suggested_Projects" rel="nofollow" title="Recent changes in pages linked from this page [k]" accesskey="k">Related changes</a></li> <li id="t-specialpages"><a href="/wiki/Special:SpecialPages" title="A list of all special pages [q]" accesskey="q">Special pages</a></li> <li id="t-print"><a href="/w/index.php?title=Suggested_Projects&printable=yes" rel="alternate" title="Printable version of this page [p]" accesskey="p">Printable version</a></li> <li id="t-permalink"><a href="/w/index.php?title=Suggested_Projects&oldid=1662629" title="Permanent link to this revision of the page">Permanent link</a></li> <li id="t-info"><a href="/w/index.php?title=Suggested_Projects&action=info" title="More information about this page">Page information</a></li> </ul> </div> </div> </div> <div class="visualClear"></div> <div id="footer" role="contentinfo"> <div id="f-poweredbyico"> <a href="//www.mediawiki.org/"><img src="/w/resources/assets/poweredby_mediawiki_88x31.png" alt="Powered by MediaWiki" srcset="/w/resources/assets/poweredby_mediawiki_132x47.png 1.5x, /w/resources/assets/poweredby_mediawiki_176x62.png 2x" width="88" height="31"/></a> </div> <ul id="f-list"> <li id="lastmod"> This page was last edited on 17 January 2025, at 09:32.</li> <li id="copyright">Content is available under <a href="/wiki/The_OEIS_End-User_License_Agreement" title="The OEIS End-User License Agreement">The OEIS End-User License Agreement</a> unless otherwise noted.</li> <li id="privacy"><a href="/wiki/OeisWiki:Privacy_policy" class="mw-redirect" title="OeisWiki:Privacy policy">License Agreements, Terms of Use, Privacy Policy</a></li> <li id="about"><a href="/wiki/OeisWiki:About" class="mw-redirect" title="OeisWiki:About">About OeisWiki</a></li> <li id="disclaimer"><a href="/wiki/OeisWiki:General_disclaimer" class="mw-redirect" title="OeisWiki:General disclaimer">Disclaimers</a></li> </ul> </div> </div> <script>(window.RLQ=window.RLQ||[]).push(function(){mw.config.set({"wgPageParseReport":{"limitreport":{"cputime":"0.076","walltime":"0.085","ppvisitednodes":{"value":489,"limit":1000000},"ppgeneratednodes":{"value":2428,"limit":1000000},"postexpandincludesize":{"value":2413,"limit":2097152},"templateargumentsize":{"value":1029,"limit":2097152},"expansiondepth":{"value":13,"limit":40},"expensivefunctioncount":{"value":0,"limit":100},"timingprofile":["100.00% 32.670 1 -total"," 27.78% 9.075 1 Template:Doi"," 27.75% 9.066 1 Template:Seqfan"," 22.37% 7.309 2 Template:Tl"," 19.08% 6.232 2 Template:Hide_in_print"," 16.99% 5.550 3 Template:OEIS"," 15.64% 5.110 1 Template:Fullmonth"," 14.23% 4.650 1 Template:Wikipedia"," 8.69% 2.838 1 Template:Abbr"," 4.52% 1.477 1 Template:Only_in_print"]},"cachereport":{"timestamp":"20250223120309","ttl":86400,"transientcontent":false}}});});</script><script>(window.RLQ=window.RLQ||[]).push(function(){mw.config.set({"wgBackendResponseTime":391});});</script></body></html>