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.

A210032 a(n)=n for n=1,2,3 and 4; a(n)=5 for n >= 5.

This page as a plain text file.
%I A210032 #39 Jun 13 2025 05:46:24
%S A210032 1,2,3,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
%T A210032 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
%U A210032 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5
%N A210032 a(n)=n for n=1,2,3 and 4; a(n)=5 for n >= 5.
%C A210032 In atomic spectroscopy, a(n) is the number of D term symbols with spin multiplicity equal to n, i.e., there is one singlet-D term (n=1), and there are two doublet-D terms (n=2), three triple-D terms (n=3), four quartet-D terms (n=4) and five terms for every other D term of multiplicity 5 or higher (n >= 5).
%C A210032 Decimal expansion of 11111/9000. - _Arkadiusz Wesolowski_, Mar 29 2012
%H A210032 Dominika Závacká, Cristina Dalfó, and Miquel Angel Fiol, <a href="https://ceur-ws.org/Vol-3792/paper19.pdf">Integer sequences from k-iterated line digraphs</a>, CEUR: Proc. 24th Conf. Info. Tech. - Appl. and Theory (ITAT 2024) Vol 3792, 156-161. See p. 161, Table 2.
%H A210032 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).
%F A210032 a(n) = min(n,5). - _Wesley Ivan Hurt_, Apr 16 2014
%F A210032 From _Elmo R. Oliveira_, Jun 26 2024: (Start)
%F A210032 G.f.: x*(1+x+x^2+x^3+x^4)/(1-x) = x*(1-x^5)/(1-x)^2.
%F A210032 a(n) = 1 + A158411(n-1) = A101272(n+1) - 1 = A168093(n-1) - 2. (End)
%t A210032 Join[Range@4, Table[5, {83}]] (* _Arkadiusz Wesolowski_, Mar 29 2012 *)
%t A210032 PadRight[{1,2,3,4},120,{5}] (* _Harvey P. Dale_, Sep 23 2017 *)
%Y A210032 Cf. A010716, A101272, A158411, A168092, A128999.
%K A210032 easy,nonn
%O A210032 1,2
%A A210032 _A. Timothy Royappa_, Mar 16 2012