Pith.

Number Theory · arXiv:2611.16283 v1 · submitted 12 Nov 2026 · 12 references

Integral Exponential Series: Fibonacci Weights and Implicit Equations

J.P. Li, Y.M. Zhong, Y.B. Zhou

The paper says

“We apply classical prime-power congruence criteria to two families of exponential series.”

more of the abstract

For the Fibonacci numbers Fn, we characterize the polynomials \(P\in\Z[T]\) for which exp(∑n ≥ 1P(Fn)xn/n) has integer coefficients: this holds if and only if P is even and P(0) ≡ P(1) ≡ P(2) (mod 5). In particular, 5 is the least positive multiplier for each positive even power of Fn, and the series with weights 5Fn2k has degree 5k−1 over \(\Q(x)\) for k ≥ 1. For \(R_n(y)\in\Z[y]\) satisfying Rpn(y) ≡ Rn(y) (mod p) for every prime p and every n ≥ 1, we prove that H(x,y) = exp(∑n ≥ 1Rn(y)nxn/n) belongs to \(\Z[y][[x]]\) and that A(x) = H(x,A(x)) has a unique integral solution. For \(q\in \Z\), taking Rn(y) = qn + y proves the conjecture in OEIS A163138; the Fibonacci result proves the conjecture in A207969 and A207970. For the implicit family with indeterminate q, the coefficient of xn has degree n2, leading coefficient 1/n, and nonnegative integer coefficients in the binomial basis, for every n ≥ 1.

from the abstract

Pith says

Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

Holds up, with conditions. Solid classification of Fibonacci-weighted exponential series, plus a clean implicit-equation theorem. The displayed formulas in Section 4 have sign errors, but the main results hold. This line is wrong

3 major objections · 10 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 12 references say.

The paper says, at Section 4, displayed formulas for G2^5 and G3^25

The review did not quote this passage.

Pith says: Objection 1 of 3 · major

The displayed formulas for G2^5 and G3^25 are inverted relative to the correct expression (4.1). As the reader's report and the skeptic note, the x-coefficient of the displayed product is -1 instead of 25/125, and the Eisenstein argument requires a simple pole at (1 - L_{2k}x + x^2) but the displayed examples have the reciprocal factor.

more of objection 1

The derivation preceding (4.1) is correct, and the coefficient table in Section 8.1 supports (4.1). This is a sign error in the display that must be corrected. The central claims of Theorem 4.1 are not affected, but the displayed identities as printed are false.

This review says the paper's mathematics is wrong. Pith did not check that against the paper's source.

The paper says, at Section 2, Corollary 2.3 (necessity direction)

The review did not quote this passage.

Pith says: Objection 2 of 3 · major

The necessity direction of Corollary 2.3 relies on the uniqueness of the Euler product for an integral series with constant term 1. The paper sketches the product construction but does not give a full independent proof of integrality of the exponents.

more of objection 2

The reader's weakest assumption flags this as a potential gap. However, the paper cites the classical Dold–Euler criterion and the construction is standard; the authors could add a brief justification or a reference to a standard source (e.g., Byszewski–Graff–Ward [2]) to make the argument self-contained. This is a minor gap but should be addressed for completeness.

The paper says, at Section 8.3

The review did not quote this passage.

Pith says: Objection 3 of 3 · major

The paper states that an accompanying script verifies certain identities and congruences, but the script is not shipped. While the proofs are theoretical, the verification claim is not independently checkable. The authors should either make the script available (e.g., as ancillary material) or remove the claim of verification. This does not affect the mathematical validity but is a matter of reproducibility.

10 minor objections

The paper says, at Abstract

Pith says: minor objection 1 of 10

The abstract says 'the series with weights 5F_n^{2k} has degree 5^{k-1} over Q(x) for k≥1'. This is correct but could be clarified: the series G_k itself is algebraic of degree 5^{k-1}, not the series with weights 5F_n^{2k} (which is G_k). The phrasing is slightly ambiguous.

The paper says, at Section 1, after (1.2)

Pith says: minor objection 2 of 10

The reference to 'the entries display k=2 and k=3, respectively' could be more precise: A207969 is for k=2, A207970 for k=3. This is clear from context but could be stated explicitly.

show 8 more

The paper says, at Section 3.1, Lemma 3.1

Pith says: minor objection 3 of 10

The proof of Lemma 3.1 uses the identity 5F_n^2 = L_n^2 - 2(-1)^n and then cites Corollary 2.3 for the series (1+x)^2/(1-3x+x^2). This is fine, but the step 'cancelling 5 proves (3.1)' could be expanded: since 5F_{2n} satisfies the congruences, dividing by 5 (which is not a unit modulo p^r for p=5) requires separate handling. The paper later handles p=5 separately, so this is not a problem, but a brief remark would help.

The paper says, at Section 4, (4.1)

Pith says: minor objection 4 of 10

The product in (4.1) uses exponents (-1)^{j+1} binom(2k,j). The pairing argument is clear, but the sign convention could be explained more explicitly. Also, the factor (1 - (-1)^k x)^{(-1)^{k+1} binom(2k,k)} appears; it might be helpful to note that this factor corresponds to j=k.

The paper says, at Section 5, Lemma 5.1

Pith says: minor objection 5 of 10

The proof of Lemma 5.1 says 'including when p=2'. The binomial theorem argument for p=2 requires checking that (V + 2^t W)^2 - V^2 = 2^{t+1} VW + 2^{2t} W^2, which is divisible by 2^{t+1} because 2^{2t} is divisible by 2^{t+1} for t≥1. This is fine, but the statement could be made explicit.

The paper says, at Section 6, Proposition 6.2

Pith says: minor objection 6 of 10

The derivation of (6.3) is sketched; it might be helpful to include a few more intermediate steps for clarity.

The paper says, at Section 7, proof of Theorem 7.1

Pith says: minor objection 7 of 10

The induction argument for degree and leading coefficient is clear. However, the claim that 'all its monomial coefficients are nonnegative rational numbers' (part (i)) is asserted but not fully proved. The induction uses that sn(q) and the expansion of exp S involve nonnegative rational coefficients, but the coefficients of an(q) as a polynomial in q are not obviously nonnegative because the binomial basis expansion involves Stirling numbers.

more of objection 7

The paper later shows nonnegativity of dn,j via Stirling numbers, which implies nonnegativity of monomial coefficients? Actually, the monomial coefficients are nonnegative because the dn,j are nonnegative and the binomial coefficients have nonnegative coefficients when expanded in the monomial basis? Wait: (q choose j) expanded in monomial basis has coefficients that are Stirling numbers of the first kind, which can be negative. So nonnegativity of monomial coefficients does not follow directly from nonnegativity of dn,j. The paper claims 'all its monomial coefficients are nonnegative rational numbers' in (i). This is a separate claim that needs justification. The induction argument using (7.2) and the expansion of exp S might show that an(q) has nonnegative coefficients when expressed in the basis of monomials? Let's check: the recurrence (7.2) involves sums of products of q^{m(m-j)} and coefficients of A^j. Since A has nonnegative coefficients (by induction), and q^{m(m-j)} has nonnegative coefficients, the resulting sn(q) has nonnegative coefficients. Then exp S = sum S^r/r!; S has nonnegative coefficients, so exp S has nonnegative coefficients. This seems to show that an(q) as a polynomial in q has nonnegative coefficients. But is that true? The example a2(q) = (q^4 + 3q^2 + 4q + 4)/2 has coefficients 1/2, 0, 3/2, 2, 2? Actually: (1/2)q^4 + (3/2)q^2 + 2q + 2. These are nonnegative rational numbers. So the claim holds for n=2. The induction argument seems plausible. However, the paper's proof of (i) says 'Induction proves the nonnegativity assertion in (i).' This is a bit terse; a more detailed argument would be helpful. Also, the claim that 'all its monomial coefficients are nonnegative rational numbers' is part (i) of Theorem 7.1. This is a nontrivial combinatorial statement. The proof sketch is insufficient; the authors should provide a clear inductive argument or reference.

The paper says, at Section 8.1, Table

Pith says: minor objection 8 of 10

The table of coefficients for G_k is given for k=0 to 3 and n=0 to 5. It would be helpful to label the rows clearly (e.g., 'k=0', 'k=1', etc.). The current formatting is ambiguous.

The paper says, at References

Pith says: minor objection 9 of 10

Reference [4] (Fried) is listed as 'preprint, 2026'. This is acceptable but the paper should note that it is a preprint. Also, reference [2] (Byszewski et al.) is a published paper; the citation is correct.

The paper says, at General

Pith says: minor objection 10 of 10

There are a few typographical issues: in the abstract, 'exp(∑_{n≥1}P(F_n)x^n/n)' should have parentheses for clarity. In the proof of Lemma 3.2, 'Frobenius exchanges them, so a^p = b and b^p = a' is correct but could be phrased more precisely. These are minor.

What would settle it

Use the recurrence (8.1) with P(T)=5T^4 to compute the x-coefficient of G_2^5: a_1(G_2)=5, so [x]G_2^5 = 25. Expand the k=2 case of (4.1): (1-x)^{-6}(1+3x+x^2)^4(1-7x+x^2)^{-1} gives x-coefficient 6+12+7=25. Expand the displayed equality: (1-x)^6(1+3x+x^2)^4(1-7x+x^2) gives -6+12-7=-1. Repeat for k=3: [x]G_3^25 = 25*5 = 125; (4.1) gives 20+42+45+18=125, while the displayed product gives 20+42-45-18=-1. Whichever side matches the recurrence is the correct formula.

from the skeptic's reading

How the review went

4 readings by deepseek-v4-flash · 13 Nov 2026

  1. Reader holds up, with conditions confidence moderate
  2. Skeptic disagrees 8 min 12 s · 13,045 tokens read, 47,471 written
  3. Editor wrote the verdict above 7 s · 14,002 tokens read, 565 written
  4. Referee major revision: 3 major objections, 10 minor 28 s · 13,405 tokens read, 2,437 written

Not run on this paper: the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The review in brief, machine-written

The paper does two things well. First, it gives a complete if-and-only-if classification (Theorem 1.1) of polynomials P such that exp(∑ P(Fn) xn/n) has integer coefficients: P must be even and P(0)≡P(1)≡P(2) mod 5. This is genuinely new—the OEIS entries only had examples for k=2,3. The proof is clean: Dold–Euler criterion plus the special behavior at p=5. Second, Theorem 1.2 provides a sufficient condition for integrality of H(x,y)=exp(∑ Rn(y)n xn/n) when Rn satisfies Frobenius congruences, and shows the implicit equation A=H(x,A) has a unique integral solution. This proves the OEIS A163138 conjecture for all integer q. The implicit-series coefficient analysis (Theorem 7.1) is also new and nicely done.

The soft spots are real but local. The stress-test note is correct: the displayed formulas for G25 and G325 in Section 4 are inverted relative to the correct derivation (4.1). The x-coefficient check gives -1 instead of 25/125, and they lack the simple pole the Eisenstein argument requires. This is a sign error in the display, not in the underlying derivation—the coefficient table in Section 8.1 matches (4.1)—but as printed they are false. The authors should fix this before publication. The reader's weakest_assumption about the necessity direction of Theorem 1.1 relying on the converse of Dold–Euler is a valid concern, but the paper sketches the standard Euler product argument and cites the literature; I think it's acceptable for a paper at this level. The missing verification script (Section 8.3) is a minor reproducibility issue, not load-bearing.

Who this is for: anyone working on integral power series, Frobenius congruences, or OEIS conjectures about Fibonacci weights. The paper is clearly written and the main results are solid. It deserves a serious referee, who should flag the display errors but otherwise accept.

Recommendation: send to peer review with a note to the authors to correct the Section 4 displays and provide the verification script.

The strongest objection

Theorem 4.1 contains a concrete internal inconsistency in its displayed examples. The derivation preceding (4.1) correctly gives R_k = G_k^{d_k} as the product of (1 - lambda_j x)^{-(-1)^j C(2k,j)}. For k=2 this is R_2 = (1-x)^{-6}(1+3x+x^2)^4(1-7x+x^2)^{-1}; its x-coefficient is 6+12+7=25, matching G_2 = 1+5x+... from Section 8.1. The displayed equality instead states G_2^5 = (1-x)^6(1+3x+x^2)^4(1-7x+x^2), whose x-coefficient is -6+12-7=-1. The k=3 example is inverted in the same way: (4.1) gives x-coefficient 20+42+45+18=125, while the displayed product gives 20+42-45-18=-1. Moreover, the Eisenstein step in Theorem 4.1 requires R_k to have a simple pole at 1-L_{2k}x+x^2; for k=2 that factor is (1-7x+x^2)^{-1} in (4.1), but the displayed example has the reciprocal factor with no pole. The derivation and the coefficient table support (4.1), so the displayed identities are presumably sign errors, but as printed they are false. Theorem 1.1 and the implicit-series theorems are not affected by this display error.

The reader's weakest assumption was the converse part of the Dold-Euler criterion in Corollary 2.3. I do not think that is the real soft spot: the iterative construction given in the proof is sufficient. At each stage the remaining integral series is 1 + c_n x^n + O(x^{n+1}) with c_n an integer, so multiplying by (1-x^n)^{c_n} kills the x^n term while preserving integrality and yields the Euler product with integer exponents; this is not circular. The necessity direction of Theorem 1.1 is therefore supported. The genuine concrete problem is Section 4: the displayed formulas for G_2^5 and G_3^25 contradict formula (4.1) and the derivation before it, by exactly inverting the signs of the exponents. A one-line x-coefficient computation settles which side is correct, and it points to (4.1) and the coefficient table, with the displays being typographical inversions. Since the false displays are part of the stated algebraic results and the Eisenstein degree argument is described via the simple pole that only (4.1) has, the paper needs this correction before acceptance. The reader's CONDITIONAL verdict remains appropriate; the missing verification script from Section 8.3 is also still unresolved.

The referee's report

The paper provides a clean classification for Fibonacci-weighted exponential series, resolving OEIS conjectures and giving explicit algebraic formulas. The implicit-equation results are general and prove several conjectures. The methods are classical (Dwork-Dold criteria) but applied cleverly. The results are nontrivial and likely to be of interest to number theorists and combinatorialists. The paper is well-structured and the proofs appear sound modulo the display error in Section 4.

Pith's reading of the paper (a machine's summary, not the authors')

The paper studies two families of exponential generating functions: one with weights given by a polynomial evaluated at Fibonacci numbers, and one where the weight involves a polynomial of the series itself (implicit equation). For the Fibonacci family, the authors prove that the series has integer coefficients if and only if the polynomial is even and its values at 0, 1, 2 are congruent modulo 5. This gives a complete classification, shows that 5 is the smallest multiplier that makes every even power work, and determines the algebraic degree of the resulting series. For the implicit family, they prove that if the weight polynomials satisfy a Frobenius congruence condition (which includes simple cases like q^n + y), then the series has integer coefficients and the implicit equation has a unique integer-coefficient solution. This resolves several conjectures from the OEIS. They also compute properties of the coefficients when q is an indeterminate: the n-th coefficient is a polynomial of degree $n^{2}$, leading term 1/n, and has nonnegative integer coefficients in the binomial basis.

What carries the argument. The Dieudonné–Dwork and Dold–Euler criteria for integrality of exponential series via prime-power congruences. For Fibonacci weights, the key is the congruence F_{2mp^r} ≡ F_{$2mp^{{r-1}}$} (mod p^r) for p≠5, plus the special role of 5 via the identity 5|F_{5m} and the fact that all squares mod 5 are 0,1,4. For the implicit family, power-lifting of Frobenius congruences (Lemma 5.1) lifts congruences from mod p to mod p^r.

Core claim. The paper establishes a precise criterion for integrality of exp(sum P(F_n) x^n/n): P must be even and satisfy P(0) ≡ P(1) ≡ P(2) (mod 5). This implies that for monomials c F_n^j, integrality holds only when j=0 (any c), j>0 even and 5|c, or j odd and c=0. It also proves that the series G_k(x) = exp(sum 5 $F_n^{{2k}}$ x^n/n) is algebraic of degree $5^{{k-1}}$ over Q(x), and that for any family R_n(y) ∈ Z[y] satisfying R_{pn}(y) ≡ R_n(y) (mod p), the series H(x,y) = exp(sum R_n(y)^n x^n/n) belongs to Z[y][[x]] and the equation A(x) = H(x,A(x)) has a unique integer-coefficient solution. This proves the OEIS conjectures A163138, A207969, A207970.

The premise it rests on. The necessity direction of Theorem 1.1 assumes that the converse of the Dold–Euler criterion (Corollary 2.3) holds for integer weights: every integral exponential series with constant term 1 has a unique Euler product with integer exponents. The paper sketches this argument but does not give a full independent proof of the uniqueness of the integer exponents; if this classical fact fails for some series, the necessity direction would be unsupported.

If the paper is right (Pith's inferences, not the authors')

If the classification is correct, then for any even polynomial P with P(0)≡P(1)≡P(2) (mod 5), the series exp(∑ P(F_n) x^n/n) has integer coefficients; this includes non-monomial examples like F_n^6 - F_n^2.

The algebraic degree 5^{k-1} for G_k with weights 5F_n^{2k} shows that these series are irrational for k≥2, and their minimal polynomial can be written explicitly via a product formula.

The implicit equation A(x) = exp(∑ (q^n + A(x))^n x^n/n) has a unique integer-coefficient solution for every integer q, proving the OEIS conjecture A163138.

For the implicit family with indeterminate q, the coefficients a_n(q) are integer-valued polynomials of degree n^2 with leading coefficient 1/n, and they admit a nonnegative integer expansion in binomial coefficients.

The method applies to any R_n(y) satisfying R_{pn}(y) ≡ R_n(y) (mod p), not just q^n + y; for example, R_n(y) = P(y, q_1^n, ..., q_s^n) for any integer polynomial P and fixed integers q_i.

The condition that P(0) ≡ P(1) ≡ P(2) (mod 5) is equivalent to P(T) = c + 5 T^2 U(T^2) + (T^6 - T^2) V(T^2). This suggests that the obstruction to integrality beyond the evenness condition is captured entirely by the values of P on the residues 0,1,2 modulo 5, which may be related to the fact that F_n modulo 5 has period 20 and takes only values 0, ±1, ±2.

The paper's approach could be extended to other linear recurrence sequences that satisfy suitable prime-power congruences; the key is identifying the primes where the recurrence degenerates (like 5 for Fibonacci) and handling them separately.

The explicit product formula for G_k^{5^{k-1}} (Theorem 4.1) gives a rational function whose denominator factors are quadratic polynomials with discriminant 5 F_{2k}^2; this shows that the algebraic extension Q(x, G_k) is a Kummer extension of exponent 5^{k-1} with a specific ramification structure.

The nonnegativity of the binomial coefficients d_{n,j} in Theorem 7.1 suggests a combinatorial interpretation of a_n(q) as counting weighted lattice paths or trees, possibly related to the fact that a_n(q) is the n-th moment of some distribution.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

We apply classical prime-power congruence criteria to two families of exponential series. For the Fibonacci numbers Fn, we characterize the polynomials \(P\in\Z[T]\) for which exp(∑n ≥ 1P(Fn)xn/n) has integer coefficients: this holds if and only if P is even and P(0) ≡ P(1) ≡ P(2) (mod 5). In particular, 5 is the least positive multiplier for each positive even power of Fn, and the series with weights 5Fn2k has degree 5k−1 over \(\Q(x)\) for k ≥ 1. For \(R_n(y)\in\Z[y]\) satisfying Rpn(y) ≡ Rn(y) (mod p) for every prime p and every n ≥ 1, we prove that H(x,y) = exp(∑n ≥ 1Rn(y)nxn/n) belongs to \(\Z[y][[x]]\) and that A(x) = H(x,A(x)) has a unique integral solution. For \(q\in \Z\), taking Rn(y) = qn + y proves the conjecture in OEIS A163138; the Fibonacci result proves the conjecture in A207969 and A207970. For the implicit family with indeterminate q, the coefficient of xn has degree n2, leading coefficient 1/n, and nonnegative integer coefficients in the binomial basis, for every n ≥ 1.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-13

The authors' main claim, as the classifier picked it out 0.65

“For \(R_n(y)\in\Z[y]\) satisfying $R_{pn}(y)\equiv R_n(y)\pmod p$ for every prime $p$ and every $n\ge1$, we prove that $H(x,y)=\exp(\sum_{n\ge1}R_n(y)^n x^n/n)$ belongs to \(\Z[y][[x]]\) and that $A(x)=H(x,A(x))$ has a unique integral solution.”

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.08 · human participants 0.01 · controlled comparison 0.01 · randomized assignment 0.01 · states quantitative result 0.96 · compares with prior results 0.50 · mentions code or data availability 0.02

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
We apply classical prime-power congruence criteria to two families of exponential series. method 0.85 0.91 0.05 asserted 0.97
For the Fibonacci numbers $F_n$, we characterize the polynomials \(P\in\Z[T]\) for which $\exp(\sum_{n\ge1}P(F_n)x^n/n)$ has integer coefficients: this holds if and only if $P$ is even and $P(0)\equiv P(1)\equiv P(2)\pmod5$. result 0.97 0.93 0.35 asserted 1.00
In particular, $5$ is the least positive multiplier for each positive even power of $F_n$, and the series with weights $5F_n^{2k}$ has degree $5^{k-1}$ over \(\Q(x)\) for $k\ge1$. result 0.99 0.89 0.14 asserted 1.00
For \(R_n(y)\in\Z[y]\) satisfying $R_{pn}(y)\equiv R_n(y)\pmod p$ for every prime $p$ and every $n\ge1$, we prove that $H(x,y)=\exp(\sum_{n\ge1}R_n(y)^n x^n/n)$ belongs to \(\Z[y][[x]]\) and that $A(x)=H(x,A(x))$ has a unique integral solution. result 0.88 0.94 0.24 asserted 1.00
For \(q\in \Z\), taking $R_n(y)=q^n+y$ proves the conjecture in OEIS A163138; the Fibonacci result proves the conjecture in A207969 and A207970. interpretation 0.53 0.76 0.15 asserted 1.00
For the implicit family with indeterminate $q$, the coefficient of $x^n$ has degree $n^2$, leading coefficient $1/n$, and nonnegative integer coefficients in the binomial basis, for every $n\ge1$. result 1.00 0.88 0.22 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 5,481 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

References (12)
  1. [2] J. Byszewski, G. Graff, and T. Ward, Dold sequences, periodic points, and dynamics, Bull. Lond. Math. Soc.53(2021), 1263–1298. doi:10.1112/blms.12531. 11 on Pithdoi:10.1112/blms.12531
  2. [1] F. Beukers, M. Houben, and A. Straub, Gauss congruences for rational functions in several variables,Acta Arith.184(2018), 341–362. doi:10.4064/aa170614-13-7 on Pithdoi:10.4064/aa170614-13-7
  3. [3] P.-J. Cahen and J.-L. Chabert,Integer-Valued Polynomials, Mathematical Surveys and Monographs, vol. 48, American Mathematical Society, Providence, RI, 1997. doi:10.1090/surv/048 on Pithdoi:10.1090/surv/048
  4. [4] S. Fried, Further proofs of conjectures from the OEIS, preprint, 2026. arXiv:2607.24832 on PithPith's reviewarXiv
  5. [5] C. Krattenthaler and T. W. Müller, Truncated versions of Dwork’s lemma for exponentials of power series andp-divisibility of arithmetic functions,Adv. Math.283(2015), 489–529. doi:10.1016/j.aim.2015.05.018 on Pithdoi:10.1016/j.aim.2015.05.018
  6. [6] G. T. Minton, Linear recurrence sequences satisfying congruence conditions,Proc. Amer. Math. Soc.142(2014), 2337–2352. doi:10.1090/S0002-9939-2014-12168-X on Pithdoi:10.1090/s0002-9939-2014-12168-x
  7. [7] P. Moss and T. Ward, Fibonacci along even powers is (almost) realizable,Fibonacci Quart. 60(2022), 40–47. arXiv:2011.13068 on PithPith's reviewarXiv
  8. [8] OEIS Foundation Inc.,The On-Line Encyclopedia of Integer Sequences, entry A054888, contributed by P. Dominici, May 23, 2000; formula involving Fibonacci squares contributed by P. D. Hanna, February 21, 2012.https://oeis.org/A054888 on Pith
  9. [9] OEIS Foundation Inc.,The On-Line Encyclopedia of Integer Sequences, entry A155200, contributed by P. D. Hanna, February 4, 2009; integrality proof contributed by P. Bala, December 25, 2019.https://oeis.org/A155200 on Pith
  10. [10] OEIS Foundation Inc.,The On-Line Encyclopedia of Integer Sequences, entry A163138, contributed by P. D. Hanna, August 7, 2009.https://oeis.org/A163138 on Pith
  11. [11] OEIS Foundation Inc.,The On-Line Encyclopedia of Integer Sequences, entry A207969, contributed by P. D. Hanna, February 22, 2012; algebraic formula contributed by P. Bala, April 3, 2014.https://oeis.org/A207969 on Pith
  12. [12] OEIS Foundation Inc.,The On-Line Encyclopedia of Integer Sequences, entry A207970, contributed by P. D. Hanna, February 22, 2012; algebraic formula contributed by P. Bala, April 3, 2014.https://oeis.org/A207970. 12 on Pith

Topics: The Collatz Conjecture

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment