The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A290194 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A290194

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 705", based on the 5-celled von Neumann neighborhood.
(history; published version)

#14 by N. J. A. Sloane at Thu Nov 01 16:00:21 EDT 2018

STATUS

reviewed

approved

#13 by Michel Marcus at Thu Nov 01 15:35:24 EDT 2018

STATUS

proposed

reviewed

#12 by Chai Wah Wu at Thu Nov 01 13:50:53 EDT 2018

STATUS

editing

proposed

#11 by Chai Wah Wu at Thu Nov 01 13:46:52 EDT 2018

FORMULA

From Chai Wah Wu, Nov 01 2018: (Start)

a(n) = 2*a(n-1) + a(n-2) - 2*a(n-3) for n > 5 (conjectured).

G.f.: (2*x^5 + x^4 + 3*x^3 + 1)/((x - 1)*(x + 1)*(2*x - 1)) (conjectured). (End)

STATUS

approved

editing

#10 by N. J. A. Sloane at Sun Jul 23 21:52:21 EDT 2017

STATUS

proposed

approved

#9 by David A. Corneth at Sun Jul 23 16:56:53 EDT 2017

STATUS

editing

proposed

#8 by David A. Corneth at Sun Jul 23 16:56:47 EDT 2017

FORMULA

Conjecture: a(n) = Fibonacci(2*n+1) if n <= 3, for n > 3, a(n) = 2*a(n-1) + 2 if n is even, a(n) = 2*a(n-1) + 5 if n is odd. It would follow that a(n) = 2^(n+1) - 4 + (n mod 2) for n >= 3. - David A. Corneth, Jul 23 2017

#7 by David A. Corneth at Sun Jul 23 16:52:24 EDT 2017

FORMULA

Conjecture: a(n) = Fibonacci(2*n+1) if n <= 3, for n > 3, a(n) = 2*a(n-1) + 2 if n is even, a(n) = 2*a(n-1) + 5 if n is odd. - David A. Corneth, Jul 23 2017

STATUS

proposed

editing

#6 by Robert Price at Sun Jul 23 16:37:55 EDT 2017

STATUS

editing

proposed

#5 by Robert Price at Sun Jul 23 16:37:52 EDT 2017

CROSSREFS

Cf. A290192, A290193, A290195.