a(n) is the least period of the 5-step recurrence x(k) = (x(k-1) + x(k-2) + x(k-3) + x(k-4) + x(k-5)) mod prime(n) for initial conditions (x(0),x(1),x(2),x(3),x(4)) other than (0,0,0,0,0) in [0..prime(n)-1]^5.
A371595
a(n) is the least period of the 5-step recurrence x(k) = (x(k-1) + x(k-2) + x(k-3) + x(k-4) + x(k-5)) mod prime(n) for initial conditions (x(0),x(1),x(2),x(3),x(4)) other than (0,0,0,0,0) in [0..prime(n)-1]^5.
Terms
- a(0) =1a(1) =8a(2) =781a(3) =2801a(4) =16105a(5) =30941a(6) =88741a(7) =9a(8) =22a(9) =14a(10) =190861a(11) =1926221a(12) =2896405a(13) =7a(14) =23a(15) =8042221a(16) =29a(17) =10a(18) =66a(19) =560a(20) =18a(21) =39449441a(22) =6888a(23) =88a(24) =32a(25) =100a(26) =34a(27) =132316201a(28) =108a(29) =16
External references
- oeis: A371595