数学中国

 找回密码
 注册
搜索
热搜: 活动 交友 discuz
楼主: 白新岭

[原创]k生素数群的数量公式

  [复制链接]
 楼主| 发表于 2021-5-22 09:50 | 显示全部楼层
https://www.so.com/link?m=bl8l2A ... Z%2F9a8zj23NaEgs%3D
这是一个连接,不知道能否成功。要不就搜寻“A005597-OEIS”。

点评

老师的这个网页给出1001位哈李常数,另一以网页A114907给出102位,足够了!实际计算时前15位是有效的,第16位以后的均无效,不必再考虑!  发表于 2021-5-22 13:05
回复 支持 反对

使用道具 举报

 楼主| 发表于 2021-5-22 10:00 | 显示全部楼层
我发的帖子内容可能在2004年我开始学电脑时就已经有了。不过总有没有的,即便已经有了,我的仍就有很大的作用,因为解决问题的方法不同。它们都是拿来主义者,借用了拉曼纽扬系数。没有寻根问底。一直以来,只是一种猜测公式。
回复 支持 反对

使用道具 举报

 楼主| 发表于 2021-5-22 10:02 | 显示全部楼层
白新岭 发表于 2021-5-22 09:50
https://www.so.com/link?m=bl8l2Az%2B7pnbgTbvCuCUpoNA3MgV5Q3KJWHkjqfB%2FcSdhgtXcbIyLSpbznrrCyTooKVCvJ ...

连接是成功的。熊一兵先生以后如果给大家提供一个好的内容连接,不用在发愁了。
回复 支持 反对

使用道具 举报

 楼主| 发表于 2021-5-22 18:53 | 显示全部楼层
The sequences were transferred to punched cards in 1967, and were made into a book in 1973 ("A Handbook of Integer Sequences", by NJAS, Academic Press, NY). This book contained 2372 sequences.这些序列在1967年被转移到穿孔卡片上,并在1973年被编入一本书(“整数序列手册” ,由 njas 出版社出版,学术出版社,纽约)。这本书包含了2372个序列。
回复 支持 反对

使用道具 举报

 楼主| 发表于 2021-5-22 18:55 | 显示全部楼层

[Incidentally, today these cards are sometimes referred to as "punch cards" (sic). This is wrong, they were always called "punched cards". Anyone who says "punch cards" is showing they know nothing about the subject. Saying "punch cards" is like saying "hike boots" or "walk stick" or "chew gum".]
顺便提一下,今天这些卡片有时被称为“穿孔卡片”(原文如此)。这是错的,他们总是被称为“穿孔卡”。任何说”打孔卡”的人,都是在表示他们对这个主题一无所知。说“穿孔卡片”就像说“远足靴”或“拐杖”或“嚼口香糖”。]
回复 支持 反对

使用道具 举报

 楼主| 发表于 2021-5-22 18:56 | 显示全部楼层
NJAS joined AT&T Bell Laboratories in 1969. Following the publication of the book, a large amount of correspondence ensued, with suggestions for further sequences and updates to the existing entries. Many people remarked how useful they found the book, and how surprising it was that no one had published such a collection before.Njas 在1969年加入 at & t 贝尔实验室。在这本书出版后,大量的信件随之而来,并建议进一步的序列和更新现有的条目。许多人评论说,他们发现这本书是多么有用,以前没有人出版过这样的集子,这是多么令人惊讶。
回复 支持 反对

使用道具 举报

 楼主| 发表于 2021-5-22 18:58 | 显示全部楼层
By the early 1990's over a cubic meter of correspondence had accumulated. A Canadian mathematician, Simon Plouffe, offered to help in preparing a revised edition of the book, and in 1995 "The Encyclopedia of Integer Sequences", by NJAS and Simon Plouffe, was published by Academic Press, San Diego. It contained 5487 sequences, occupying 587 pages. (Incidentally, Simon Plouffe is now one of the Trustees of The OEIS Foundation Inc..)到1990年代早期,超过一立方米的信件积累。一位加拿大数学家,西蒙 · 普劳夫,提出帮忙准备这本书的修订版1995年,由恩哈斯和西蒙 · 普劳夫编写的”整数序列百科全书”由圣地亚哥学术出版社出版。它包含5487个序列,占据了587页。顺便说一句,西蒙 · 普劳夫现在是 oeis 基金会的理事之一
回复 支持 反对

使用道具 举报

 楼主| 发表于 2021-5-22 19:00 | 显示全部楼层
Again, once the book appeared, many further sequences and updates were submitted from people all over the world. NJAS waited a year, until the size of the collection had doubled, to 10000 entries, and then in 1996 he launched The On-Line Encyclopedia of Integer Sequences® (OEIS®) on the Internet. From 1996 until October 26, 2009, this was part of NJAS's home page on the AT&T Labs website.

During this period, from 1996 to 2009, the database grew by at least 10000 entries per year (18000 new sequences were added in 2009 alone). If it were to be published in book form today, the OEIS would require over 750 volumes, each the size of the 1995 book.

Starting in 2002, NJAS added a group of associate editors to help process submissions. However, because they did not have access to the computer where the database was maintained, almost all the work of updating had to be done single-handedly by NJAS. This involves processing 100 or 200 emails every day, and was getting to be beyond what one person can handle.同样,这本书一出版,全世界的人们就提交了更多的序列和更新。Njas 等了一年,直到收藏规模翻了一番,达到了10000条。1996年,他在互联网上推出了 oeis 整数数列线上大全。从1996年到2009年10月26日,这是 njas 在 at & t 实验室网站上主页的一部分。在此期间,从1996年到2009年,该数据库每年至少增加10000个条目(仅2009年就增加了18000个新序列)。如果今天以书的形式出版,oeis 将需要超过750卷,每一卷都和1995年的书一样大。从2002年开始,njas 增加了一组助理编辑来帮助处理投稿。然而,由于他们无法访问维护数据库的计算机,几乎所有的更新工作都必须由 njas 单独完成。这包括每天处理100到200封电子邮件,而且已经超出了一个人的能力范围。
回复 支持 反对

使用道具 举报

 楼主| 发表于 2021-5-22 19:02 | 显示全部楼层
In 2009, therefore, it was decided to make a drastic change. NJAS set up a non-profit foundation, The OEIS Foundation Inc., whose purpose is to own, maintain and raise funds to support The On-Line Encyclopedia of Integer Sequences® (OEIS®). On October 26, 2009, NJAS transferred the intellectual property of The On-Line Encyclopedia of Integer Sequences to the Foundation and work was begun on moving the database from NJAS's home page at AT&T to a commercial hosting service.

Here, however, we ran into a very serious problem. In the summer of 2009, when we tried to get the OEIS working as a wiki, we discovered that the Mediawiki software was not capable of handling the kind of queries that arise in looking up sequences. This was a disaster.在2009年,因此,它决定作出重大改变。Njas 成立了一个非盈利基金会 oeis 基金会,其宗旨是拥有、维护和筹集资金以支持整数数列线上大全。2009年10月26日,njas 将整数数列线上大全的知识产权转移到基金会,并开始将数据库从 at & t 的 njas 主页转移到商业托管服务。2009年夏天,当我们试图让 oeis 像 wiki 一样工作时,我们发现 mediawiki 软件不能处理查找序列时出现的查询。真是场灾难。
回复 支持 反对

使用道具 举报

 楼主| 发表于 2021-5-22 22:44 | 显示全部楼层
   截止2021年5月21日星期五四月初十21:43分,浏览量32307人次,回复2218,热度94°。
截止2021年5月22日星期六四月初十一22:41分,浏览量32445人次,回复2236,热度94°。
                                                                            浏览量  ↑138人次, 回复 ↑ 18,热度 →°
晚安!good-bye
回复 支持 反对

使用道具 举报

您需要登录后才可以回帖 登录 | 注册

本版积分规则

Archiver|手机版|小黑屋|数学中国 ( 京ICP备05040119号 )

GMT+8, 2025-7-20 11:39 , Processed in 0.122583 second(s), 16 queries .

Powered by Discuz! X3.4

Copyright © 2001-2020, Tencent Cloud.

快速回复 返回顶部 返回列表