cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A334121 a(n) is the multiplicative inverse of A008514(n) modulo A008514(n+1).

Original entry on oeis.org

1, 40, 271, 183, 1184, 102, 2861, 9102, 4446, 16837, 3483, 25332, 62253, 30739, 88410, 26394, 111803, 2177, 123512, 298353, 110585, 346624, 55398, 366215, 782616, 335806, 866645, 228189, 893798, 9628, 832307, 1873716, 643300, 1905211, 280161, 1793338, 3647187
Offset: 0

Views

Author

Daniel Hoyt, Apr 14 2020

Keywords

Crossrefs

Programs

  • PARI
    f(n) = n^4 + (n+1)^4; \\ A008514
    a(n) = lift(1/Mod(f(n), f(n+1)));
    
  • Python
    import gmpy2
    soc = [] # sum of 4d-centered cubes
    a=0
    b=1
    for i in range(100):
        c = a**4 + b**4
        soc.append(c)
        a += 1
        b += 1
    A334121 = []
    for i in range(len(soc)-1):
        c = gmpy2.invert(soc[i], soc[i+1])
        A334121.append(int(c))
    print(', '.join([str(x) for x in A334121]))
Showing 1-1 of 1 results.