[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A364057 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Lexicographically earliest infinite sequence of positive integers such that every subsequence {a(j), a(j+k), a(j+2k)} (j, k >= 1) is unique.
(history; published version)
#28 by OEIS Server at Sat Nov 04 13:47:14 EDT 2023
LINKS

Rémy Sigrist, <a href="/A364057/b364057_1.txt">Table of n, a(n) for n = 1..10000</a>

#27 by Peter Luschny at Sat Nov 04 13:47:14 EDT 2023
STATUS

reviewed

approved

Discussion
Sat Nov 04
13:47
OEIS Server: Installed first b-file as b364057.txt.
#26 by Peter Munn at Sat Nov 04 12:14:59 EDT 2023
STATUS

proposed

reviewed

#25 by Rémy Sigrist at Sat Nov 04 11:59:22 EDT 2023
STATUS

editing

proposed

#24 by Rémy Sigrist at Sat Nov 04 11:57:58 EDT 2023
LINKS

Rémy Sigrist, <a href="/A364057/b364057_1.txt">Table of n, a(n) for n = 1..10000</a>

Rémy Sigrist, <a href="/A364057/a364057.txt">C++ program</a>

PROG

(C++) See Links section.

STATUS

approved

editing

Discussion
Sat Nov 04
11:59
Rémy Sigrist: added program + b-file
#23 by Michael De Vlieger at Sat Nov 04 08:47:48 EDT 2023
STATUS

proposed

approved

#22 by Peter Munn at Fri Nov 03 08:25:24 EDT 2023
STATUS

editing

proposed

#21 by Peter Munn at Fri Nov 03 08:11:13 EDT 2023
COMMENTS

In the 74 initially published terms, numbers on average seem to reoccur at (very) roughly twice the index of their previous occurrence. This seems worthy of better quantification when further terms are established. - Peter Munn, Nov 03 2023

#20 by Peter Munn at Fri Nov 03 07:59:37 EDT 2023
NAME

Lexicographically earliest infinite sequence of positive integers such that any every subsequence {a(j), a(j+k), a(j+2k)} (for any j and , k >= 1) is unique.

COMMENTS

1. Every subsequence {a(n-2m2k), a(n-mk) a(n)} created by a(n) must be unique.

After a(For n >= 3), , a(n) != a(n+1).

STATUS

approved

editing

#19 by Michael De Vlieger at Thu Nov 02 23:42:37 EDT 2023
STATUS

reviewed

approved