| ; A132636: a(n) = Fibonacci(n) mod n^3. | |
| ; Submitted by Simon Strandgaard | |
| ; 0,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,1685,7063,4323,4896,12525,15937,19271,10483,2060,22040,5674,15621,2752,3807,9340,432,46989,19305,11932,62155 | |
| add $0,1 | |
| mov $1,$0 | |
| seq $0,45 ; Fibonacci numbers: F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1. | |
| pow $1,3 | |
| mod $0,$1 | |