Your task is to write some code that outputs an OEIS sequence, and contains the name of the sequence in the code (
A______). Easy enough right? Well here's the catch, your code must also output a second separate sequence when the name of the sequence in the code is changed to the name of the second sequence.
Your code can be a function or complete program that takes n via a standard input method and outputs the nth term of the sequence as indexed by the provided index on the OEIS page.
You must support all values provided in the OEIS b files for that sequence, any number not in the b files need not be supported.
This is code-golf. Your score will be the number of bytes in your code, with less bytes being better.
Here's an example in Haskell that works for A000217 and A000290.