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.
%I A063914 #24 Jul 02 2025 20:00:16
%S A063914 1,2,3,5,5,8,7,11,9,14,11,17,13,20,15,23,17,26,19,29,21,32,23,35,25,
%T A063914 38,27,41,29,44,31,47,33,50,35,53,37,56,39,59,41,62,43,65,45,68,47,71,
%U A063914 49,74,51,77,53,80,55,83,57,86,59,89,61,92,63,95,65,98,67,101,69,104,71
%N A063914 Odd numbers interlaced with numbers 3m+2.
%C A063914 The reference gives the sequence without the initial 1 and then it is "alternate 3n+2 and 2n+3".
%C A063914 An alternative solution for this sequence is to consider the first second differences repeat giving 2, 3, 5, 5, 8, 7, 11, 12, 14, 14, 17, 16, 20, 21. - Lorraine Gregory, Ed.D. (lgregory(AT)lssu.edu), Jan 19 2009
%D A063914 D. Dolan, J. Williamson and M. Muri, Mathematics Activities for Elementary School Teachers: A Problem Solving Approach, Addison Wesley Longman, Inc., NY, Fourth Edition (ISBN 0-201-61321-2), Chapter 1, Activity 2, #9.
%H A063914 Harry J. Smith, <a href="/A063914/b063914.txt">Table of n, a(n) for n = 1..1000</a>
%H A063914 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,2,0,-1).
%F A063914 From _Colin Barker_, Mar 28 2012: (Start)
%F A063914 a(n) = 2*a(n-2)-a(n-4).
%F A063914 G.f.: x*(1+2*x+x^2+x^3)/((1-x)^2*(1+x)^2). (End)
%F A063914 a(n) = (5*n - 2 + (-1)^n*(n - 2))/4. - _Andrew Howroyd_, Dec 26 2024
%p A063914 for n from 0 to 80 do printf(`%d,%d,`, 2*n+1, 3*n+2) od:
%t A063914 nn=50;Riffle[Range[1,2*nn,2],3*Range[0,nn]+2] (* _Harvey P. Dale_, Jan 16 2013 *)
%o A063914 (PARI) a(n) = { if (n%2, n, 3*n/2 - 1) } \\ _Harry J. Smith_, Sep 02 2009
%K A063914 nonn,easy
%O A063914 1,2
%A A063914 Nancy Shaffer (nancys(AT)rose.net), Aug 30 2001
%E A063914 Better description from _Brian Galebach_, Sep 05 2001
%E A063914 More terms from _James Sellers_, Sep 25 2001