Seeking Secret Swapping Sequences This is a cops-and-robbers challenge, the robbers thread can be found here.


Your task is to write some code that outputs an OEIS sequence, and contains the name of the sequence in the code (A______) and outputs a second separate sequence when the name of the sequence in the code is changed to the name of the second sequence.

Here's an example in Haskell that works for A000217 and A000290.



f x|last"A000217"=='0'=x^2|1&gt;0=sum[1..x]


Try it online!

You are then to reveal one of the two sequences, and the code keeping the second sequence a secret.  Robbers will attempt to figure out what the hidden sequence is.  If a robber manages to determine what your sequence is (or another sequence that fits the criteria) you answer is cracked.  If none do so in a week of your answer being posted you may mark your answer as Safe and reveal the intended solution for verification.  Safe answers cannot be cracked.

Input Output

Taken from here

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. 

Scoring

Your score will be the number of bytes in your code, with less bytes being better.
Python 3, 59 bytes, A162626, cracked
lambda n:n*(n+1)*(n+2)/3if 0&lt;=n&lt;=3else n*(n**2+5)/3#A162626

This is was supposed to be impossible, wasn't it?