#proj7.txt, April 13 2024
#Project Member: Gloria Liu
#Project 7: Given a large positive integer A Consider the sequences of the form

#Coefficient of x^0 in (a+b/x+c*x)^n for -A ≤ a,b,c ≤ A, and igcd(a,b,c)=1

#Construct a data base, in the style of the OEIS, that lists the first 30 terms of each, and the 
#linear recurrences obtained via the famous Almkvist-Zeilberger algorithm, with the command

#AZd( (a+b/x+c*x)^n/x,n,N)[1]

#in the Maple package EKHAD.txt

#Find out which ones are already in the OEIS.

#=====================================#
Help:=proc() print(`Seq(a,b,c,K), Reccurence(a,b,c,n,N)`) end:

read `EKHAD.txt`:

Seq:= proc(a, b, c, K) local n, x:
[seq(coeff(expand((a*x + b + c/x)^n), x, 0), n = 1 .. K)]: 
end:

Reccurence:=proc(a, b, c, n, N) local x: 
AZd((a*x + b + c/x)^n/x, x, n, N)[1]:
end: