{"id":"palomar/PALOMAR-2026-11-11-000001","url":"https://github.com/veljjanoski/oeis100475-palomar/tree/0968200356e449a24a023264821d4ea966091cf0","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-11-000001-v1.json","repo":"https://github.com/veljjanoski/oeis100475-palomar","tags":["math.NT","msc:11A63","msc:11N05","msc:11B83"],"score":0,"title":"OEIS A100475: the reverse-prime map never loops","trust":"high","domain":"math.NT","source":"palomar","authors":["Daniel Veljjanoski"],"reviews":0,"subject":"math.NT","summary":"Let f(y) be the decimal reversal of the y-th prime (f(1) = 2, f(2) = 3, f(5) = 11, f(11) = 13). OEIS A100475 is the orbit of 1 under f, and its entry asks (Jonathan Vos Post, 2004) whether the orbit of any other positive start ever enters a loop. This project proves that it never does, i.e. the negation of the formal-conjectures statement OeisA100475.conjecture: the number of digits never decreases along an orbit (p_y > y, and a prime never ends in 0), so on a cycle it is a constant D and every cycle element v satisfies p_v = 5 it contradicts the bound pi'(10^D) = 9 by Chebyshev's bound…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-11","reactions":{},"formalized":true,"formalizes":[{"title":"A100475: Prime-th recurrence with reversal at each step","identifier":"","relationship":"formalizes"},{"title":"Essai sur la théorie des nombres (2nd ed.)","identifier":"","relationship":"adapts"}]}