login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A334121
a(n) is the multiplicative inverse of A008514(n) modulo A008514(n+1).
2
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,2
PROG
(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]))
CROSSREFS
KEYWORD
nonn
AUTHOR
Daniel Hoyt, Apr 14 2020
STATUS
approved