OFFSET
0,2
COMMENTS
Does iterating n -> a(n) always reach 1 (i.e., the cycle 1 -> 26 -> 4 -> 1)?
LINKS
Index entries for linear recurrences with constant coefficients, signature (0,1,0,0,0,0,0,1,0,-1).
FORMULA
a(2*n+1) = a(2*n-1) + 50 for n > 0.
a(8*n) = a(8*n-2) = a(8*n-4) = a(8*n-6) for n > 0.
a(n) = a(n-2) + a(n-8) - a(n-10).
G.f.: (26*x + x^2 + 50*x^3 + 50*x^5 + 50*x^7 + 24*x^9) / ((1-x^2) * (1-x^8)).
MATHEMATICA
a[n_] := If[OddQ[n], 25*n + 1, Floor[(n + 6)/8]]; Array[a, 100, 0] (* Amiram Eldar, Nov 27 2025 *)
PROG
(PARI) a(n) = if(n%2==0, floor((n+6)/8), 25*n+1)
(Python)
def A391075(n): return 25*n+1 if n&1 else n+6>>3 # Chai Wah Wu, Nov 30 2025
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Werner Schulte, Nov 27 2025
STATUS
approved
