|
| |
|
|
A242615
|
|
a(n) = exp( (log P(n))^2 - log(n!) ), multiplied by 100 and rounded to the nearest integer, where P(n) is the partition number A000041(n).
|
|
2
|
|
|
|
100, 81, 56, 56, 37, 44, 30, 35, 29, 32, 27, 33, 29, 32, 31, 35, 34, 39, 38, 43, 44, 48, 50, 56, 58, 64, 67, 74, 77, 85, 90, 98, 104, 113, 119, 130, 137, 147, 156, 167, 176, 188, 197, 210, 220, 232, 243, 255, 265, 278, 288, 299, 309, 320, 328, 338, 345, 354, 360, 367, 371, 376, 378, 381, 382, 383, 381, 380, 377, 373, 368, 363, 356, 349, 341, 332, 322, 312, 302, 291, 279, 268, 256, 244, 232, 220, 208, 196, 184, 173, 161, 151, 140, 130, 120, 111, 102, 94, 86, 78, 71, 65, 59, 53, 48, 43, 38, 34, 31, 27, 24, 21, 19, 17, 15, 13, 11, 10, 8, 7, 6, 5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
The original definition was "Number of messages maximally transmittable by using n objects as a non-sequenced collection, expressed as a percentage of the number of messages maximally transmittable by using n objects as a sequenced collection."
This sequence compares the number of distinct (distinguishable) states a collection can be in. There are two ways to read symbols off a collection: the sequential and the commutative ways. In an idealized case, the objects seen as sequentially ordered will each possess one symbol which individuates this element fully against all other elements in the collection. Then, there are n! distinct states of the collection achievable. This is also the maximal number of messages that can be transmitted by using n objects as elements in a sequence.
Reading the collection by building groups among elements that share a symbol one arrives at an upper limit, here called for ease of comparison "n?", which is given by the number of partitions of n raised to the power of the logarithm of the number of partitions of n.
Being sequenced or non-sequenced is a property that the human spectator looks into the collection (cf. Rorschach-Test). The collection itself possesses the immanent, intrinsic property of being both sequenced and non-sequenced.
The discussion centers on what is known in data processing as sequential vs. index-based retrieval. We investigate how many index queries are necessary until one identifies each one specific element of a data set; would this method be more efficient than the usual method of assigning each element a sequential number.
The numbers show that a translation exists between group and sequential properties. The non-integer result for n? comes from the decreasing probability of successive index searches to bring forth such elements that have not yet been found in the course of previous index searches.
The interplay between linear and nonlinear order concepts can be used efficiently and practically by making use of the chains that connect elements into groups (thus creating commutative, contemporary group relations) and at the same time assigning to each element a sequential number that refers to the place within the chains' succession. (Cf. A235647 for a definition of chains.)
|
|
|
LINKS
|
Karl Javorszky, "Data versus information", Krassimir Markov, ed., Information Theories and Applications (2017), Vol. 24, No. 4, see pages 308 & 317.
Karl Javorszky, Picturing Order, Contemporary Computational Science (2018), 3rd Conf. on Inf. Tech. Systems Res. and Comp. Phys. (ITSRCP18), 83-91.
|
|
|
FORMULA
|
|
|
|
MATHEMATICA
|
Array[Round[100 Exp[Log[PartitionsP[#]]^2 - Log[#!]]] &, 150] (* Michael De Vlieger, Sep 27 2022 *)
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,uned
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
