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.

A304383 a(n) = 36*2^n - 5 (n>=1).

Original entry on oeis.org

67, 139, 283, 571, 1147, 2299, 4603, 9211, 18427, 36859, 73723, 147451, 294907, 589819, 1179643, 2359291, 4718587, 9437179, 18874363, 37748731, 75497467, 150994939, 301989883, 603979771, 1207959547, 2415919099, 4831838203, 9663676411, 19327352827, 38654705659, 77309411323
Offset: 1

Views

Author

Emeric Deutsch, May 13 2018

Keywords

Comments

a(n) is the number of edges in the molecular graph NS2[n], defined pictorially in the Ashrafi et al. reference (Fig. 2, where NS2[2] is shown).

Crossrefs

Cf. A304382.

Programs

  • GAP
    List([1..40],n->36*2^n-5); # Muniru A Asiru, May 13 2018
    
  • Maple
    seq(36*2^n-5, n = 1 .. 40);
  • PARI
    Vec(x*(67 - 62*x) / ((1 - x)*(1 - 2*x)) + O(x^40)) \\ Colin Barker, May 14 2018

Formula

From Colin Barker, May 14 2018: (Start)
G.f.: x*(67 - 62*x) / ((1 - x)*(1 - 2*x)).
a(n) = 3*a(n-1) - 2*a(n-2) for n>2.
(End)