Reverse your code, reverse the OEIS The task here is to write a program that takes an natural number, \$n\$, and produces the \$n\$th term of an OEIS sequence.  That sequence should have an identifier in the form of A followed by 6 digits.  Now when you take your source code and reverse the order of it's bytes to produce a new program, that program should also implement an OEIS sequence.  The new sequence should be identified by an A followed by the same 6 digits as last time but in reverse order (including leading zeros).

Now to keep things from being trivial neither the OEIS identifier number nor your program can be palindromes.  That is the sequences and programs should be different. You cannot choose a sequence for which it's reverse does not exist or is empty.

For each of your sequences you may choose to either use 0 or 1 indexing.  They do not have to use the same indexing. Since some OEIS sequences have a limited domain you need only output the correct numbers for the domain of the sequence.  Your required behavior is undefined outside of the domain (you can output 0, crash, order a pizza, etc.).

This is code-golf so answers will be scored in bytes with fewer bytes being better.
05AB1E, 9 4 bytes (A000040 and A040000)

Ø=&gt;≠


Try it online!

!enilno ti yrT

Explanation:

Ø          # nth prime
 =         # output
  &gt;≠       # ignored


:noitanalpxE

≠          # boolean negation (0 if n == 1, 1 otherwise)
 &gt;         # increment
  =        # output
   Ø       # ignored