Return to Answer

replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/

edited Apr 13, 2017 at 12:39

Python, 108, CAD97 CAD97, A005132

def a(n): if n == 0: return 0 f=a(n-1)-n return f if f>0 and not f in(a(i)for i in range(n))else a(n-1)+n

Obfuscated code :

def a(n): ###n####0######n#0 f=a####### return f #f#####a###### f ####a(##f###i#i###a####n##else a#######

Outputs:

>>> a(0) 0 >>> a(4) 2 >>> a(16) 8 >>> a(20) 42

def a(n): if n == 0: return 0 f=a(n-1)-n return f if f>0 and not f in(a(i)for i in range(n))else a(n-1)+n

Obfuscated code :

def a(n): ###n####0######n#0 f=a####### return f #f#####a###### f ####a(##f###i#i###a####n##else a#######

Outputs:

>>> a(0) 0 >>> a(4) 2 >>> a(16) 8 >>> a(20) 42

def a(n): if n == 0: return 0 f=a(n-1)-n return f if f>0 and not f in(a(i)for i in range(n))else a(n-1)+n

Obfuscated code :

def a(n): ###n####0######n#0 f=a####### return f #f#####a###### f ####a(##f###i#i###a####n##else a#######

Outputs:

>>> a(0) 0 >>> a(4) 2 >>> a(16) 8 >>> a(20) 42

answered Apr 10, 2016 at 20:57

def a(n): if n == 0: return 0 f=a(n-1)-n return f if f>0 and not f in(a(i)for i in range(n))else a(n-1)+n

Obfuscated code :

def a(n): ###n####0######n#0 f=a####### return f #f#####a###### f ####a(##f###i#i###a####n##else a#######

Outputs:

>>> a(0) 0 >>> a(4) 2 >>> a(16) 8 >>> a(20) 42