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.

A289521 Number of vertices in a planar Apollonian graph at iteration n.

This page as a plain text file.
%I A289521 #24 Feb 16 2025 08:33:48
%S A289521 4,7,16,43,124,367,1096,3283,9844,29527,88576,265723,797164,2391487,
%T A289521 7174456,21523363,64570084,193710247,581130736,1743392203,5230176604,
%U A289521 15690529807,47071589416,141214768243,423644304724,1270932914167,3812798742496,11438396227483,34315188682444
%N A289521 Number of vertices in a planar Apollonian graph at iteration n.
%H A289521 Colin Barker, <a href="/A289521/b289521.txt">Table of n, a(n) for n = 1..1000</a>
%H A289521 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ApollonianNetwork.html">Apollonian Network</a>
%H A289521 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,-3).
%F A289521 From _Colin Barker_, Jul 07 2017: (Start)
%F A289521 G.f.: x*(4 - 9*x) / ((1 - x)*(1 - 3*x)).
%F A289521 a(n) = (5 + 3^n) / 2.
%F A289521 a(n) = 4*a(n-1) - 3*a(n-2) for n>2.
%F A289521 (End)
%F A289521 a(n) = a(n-1) + 3^(n-1) for n>1. - _Andrew D. Walker_, Jul 07 2017
%o A289521 (PARI) a(n)=(3^n+5)/2 \\ _Charles R Greathouse IV_, Jul 07 2017
%o A289521 (PARI) Vec(x*(4 - 9*x) / ((1 - x)*(1 - 3*x)) + O(x^30)) \\ _Colin Barker_, Jul 07 2017
%K A289521 nonn,easy
%O A289521 1,1
%A A289521 _Andrew D. Walker_, Jul 07 2017