The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A368558 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A368558

Number of fractions i/n that are in the Cantor set.
(history; published version)

#25 by OEIS Server at Fri Jan 12 10:05:24 EST 2024

LINKS

Jason Yuen, <a href="/A368558/b368558_1.txt">Table of n, a(n) for n = 1..10000</a>

#24 by Michael De Vlieger at Fri Jan 12 10:05:24 EST 2024

STATUS

reviewed

approved

Discussion

Fri Jan 12

10:05

OEIS Server: Installed first b-file as b368558.txt.

#23 by Kevin Ryde at Fri Jan 12 00:15:00 EST 2024

STATUS

proposed

reviewed

#22 by Jason Yuen at Tue Jan 09 01:22:16 EST 2024

STATUS

editing

proposed

#21 by Jason Yuen at Tue Jan 09 01:22:12 EST 2024

COMMENTS

Does this sequence contain every positive even integer?

STATUS

proposed

editing

#20 by Jason Yuen at Sat Jan 06 23:34:05 EST 2024

STATUS

editing

proposed

#19 by Jason Yuen at Sat Jan 06 22:52:31 EST 2024

LINKS

Zixiang Zhou, <a href="/A368558/a368558.cpp.txt">main.cpp</a>. This C++ program fully solves CCC 2023, Problem S5 with a time complexity of O(n^(log_3(2)) log n).

Discussion

Sat Jan 06

23:33

Jason Yuen: Done. I uploaded 2 files. The first file is a b-file containing a(1) to a(10000).

The second file is a C++ program that solves Problem S5 in O(n^(log_3(2)) log n) time (sublinear time!). Afterwards, it's easy to count the number of solutions to obtain a(n).

#18 by Jason Yuen at Sat Jan 06 22:43:10 EST 2024

LINKS

Zixiang Zhou, <a href="/A368558/a368558.cpp.txt">main.cpp</a>. This C++ program fully solves CCC 2023, Problem S5.

#17 by Jason Yuen at Fri Jan 05 21:25:50 EST 2024

EXTENSIONS

Extended terms up to a(10000)

#16 by Jason Yuen at Fri Jan 05 21:21:25 EST 2024

LINKS

Jason Yuen, <a href="/A368558/b368558_1.txt">Table of n, a(n) for n = 1..10000</a>

EXTENSIONS

Extended terms up to a(10000)

STATUS

proposed

editing