27411 is a member of OEIS A341313: a(n) = (a(n-1) + a(n-3))/2^m, where 2^m is the highest power of 2 that divides both a(n-1) and a(n-3), with a(0) = a(1) = a(2) = 1.

The sequence can be generated as follows (permalink):

INPUT

a,b,c=1,1,1

L=[a,b,c]

for n in [1..50]:

  m=0

  while c%2^m==0 and a%2^m==0:

    d=(a+c)/2^m

    m+=1

  L.append(d)

  a,b,c=b,c,d

print(L)

OUTPUT

[1, 1, 1, 2, 3, 4, 3, 6, 5, 8, 7, 12, 5, 12, 6, 11, 23, 29, 40, 63, 92, 33, 96, 47, 80, 11, 58, 69, 80, 69, 138, 109, 178, 158, 267, 445, 603, 870, 1315, 1918, 1394, 2709, 4627, 6021, 8730, 13357, 19378, 14054, 27411, 46789, 60843, 88254, 135043]

27411 is a cyclic and D-number.

27411 can be converted into an integer equation as follows:

-2 + 7 = 4 + 1 x 1 and -2 + 7 - 4 = 1 ^ 1

27411 stabilises after about 117 generations of Conway's Game of Life rules to a single block and a single blinker.