cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A160415 First differences of A160118.

This page as a plain text file.
%I A160415 #24 Feb 03 2024 10:16:39
%S A160415 1,8,4,28,4,28,12,84,4,28,12,84,12,84,36,252,4,28,12,84,12,84,36,252,
%T A160415 12,84,36,252,36,252,108,756,4,28,12,84,12,84,36,252,12,84,36,252,36,
%U A160415 252,108,756,12,84,36,252,36,252,108,756,36,252,108,756,108,756,324
%N A160415 First differences of A160118.
%C A160415 Number of cells turned "ON" at n-th stage of the cellular automaton of A160118.
%H A160415 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>.
%e A160415 From _Omar E. Pol_, Mar 21 2011: (Start)
%e A160415 If written as a triangle begins:
%e A160415 1,
%e A160415 8,
%e A160415 4,28,
%e A160415 4,28,12,84,
%e A160415 4,28,12,84,12,84,36,252,
%e A160415 4,28,12,84,12,84,36,252,12,84,36,252,36,252,108,756,
%e A160415 (End)
%t A160415 With[{d = 2}, wt[n_] := DigitCount[n, 2, 1]; f[n_] := If[OddQ[n], 3^d + (2^d) * Sum[(2^d - 1)^(wt[k] - 1), {k, 1, (n - 1)/2}] + (2^d)*(3^d - 2) * Sum[(2^d - 1)^(wt[k] - 1), {k, 1, (n - 3)/2}], 3^d + (2^d) * Sum[(2^d - 1)^(wt[k] - 1), {k, 1, n/2 - 1}] + (2^d)*(3^d - 2) * Sum[(2^d - 1)^(wt[k] - 1), {k, 1, n/2 - 1}]]; f[0] = 0; f[1] = 1; Differences[Array[f, 100, 0]]] (* _Amiram Eldar_, Feb 02 2024 *)
%Y A160415 Cf. A139251, A160118, A160411, A160413, A160417.
%K A160415 nonn
%O A160415 1,2
%A A160415 _Omar E. Pol_, Jun 13 2009
%E A160415 More terms (a(8)-a(38)) from _Nathaniel Johnston_, Nov 14 2010
%E A160415 21 terms corrected between a(13) and a(38), and more terms (a(39)-a(48)) from _Omar E. Pol_, Mar 21 2011
%E A160415 More terms from _Amiram Eldar_, Feb 02 2024