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.

A271999 Halogen sequence: a(n) = A018227(n)-1.

This page as a plain text file.
%I A271999 #15 Oct 21 2024 08:59:23
%S A271999 1,11,17,35,53,85,117,167,217,289,361,459,557,685,813,975,1137,1337,
%T A271999 1537,1779,2021,2309,2597,2935,3273,3665,4057,4507,4957,5469,5981,
%U A271999 6559,7137,7785,8433,9155,9877,10677,11477,12359,13241,14209,15177,16235,17293
%N A271999 Halogen sequence: a(n) = A018227(n)-1.
%C A271999 Terms from 11 to 117 are the atomic numbers of the elements in group 17 in the periodic table. The elements in this group are also called halogens.
%H A271999 Colin Barker, <a href="/A271999/b271999.txt">Table of n, a(n) for n = 1..1000</a>
%H A271999 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (2,1,-4,1,2,-1).
%F A271999 From _Colin Barker_, Nov 14 2017: (Start)
%F A271999 G.f.: x*(1 + 9*x - 6*x^2 - 6*x^3 + 9*x^4 - x^5 - 4*x^6 + 2*x^7) / ((1 - x)^4*(1 + x)^2).
%F A271999 a(n) = (1/12)*(2*n^3 + 12*n^2 + 28*n - 12) for n>2 and even.
%F A271999 a(n) = (1/12)*(2*n^3 + 12*n^2 + 22*n - 24) for n>2 and odd.
%F A271999 a(n) = 2*a(n-1) + a(n-2) - 4*a(n-3) + a(n-4) + 2*a(n-5) - a(n-6) for n>8.
%F A271999 (End)
%t A271999 LinearRecurrence[{2, 1, -4, 1, 2, -1}, {1, 11, 17, 35, 53, 85, 117, 167}, 50] (* _Paolo Xausa_, Oct 21 2024 *)
%o A271999 (PARI) Vec(x*(1 + 9*x - 6*x^2 - 6*x^3 + 9*x^4 - x^5 - 4*x^6 + 2*x^7) / ((1 - x)^4*(1 + x)^2) + O(x^50)) \\ _Colin Barker_, Nov 14 2017
%K A271999 nonn,easy
%O A271999 1,2
%A A271999 _Natan Arie Consigli_, Jul 02 2016