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 A060747 #41 Feb 17 2025 03:20:39
%S A060747 -1,1,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,43,45,
%T A060747 47,49,51,53,55,57,59,61,63,65,67,69,71,73,75,77,79,81,83,85,87,89,91,
%U A060747 93,95,97,99,101,103,105,107,109,111,113,115,117,119,121,123,125,127,129,131,133,135,137,139,141,143,145,147,149,151
%N A060747 a(n) = 2*n - 1.
%C A060747 If you put n red balls and n blue balls in a bag and draw them one by one without replacement, the probability of never having drawn equal numbers of the two colors before the final ball is drawn is 1/a(n) unsigned.
%C A060747 abs(a(n)) = 2n - 1 + 2*0^n. It has A048495 as binomial transform. - _Paul Barry_, Jun 09 2003
%C A060747 For n >= 1, a(n) = numbers k such that arithmetic mean of the first k positive integers is an integer. A040001(a(n)) = 1. See A145051 and A040001. - _Jaroslav Krizek_, May 28 2010
%C A060747 From _Jaroslav Krizek_, May 28 2010: (Start)
%C A060747 For n >= 1, a(n) = corresponding values of antiharmonic means to numbers from A016777 (numbers k such that antiharmonic mean of the first k positive integers is an integer).
%C A060747 a(n) = A000330(A016777(n)) / A000217(A016777(n)) = A146535(A016777(n)+1). (End)
%H A060747 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A060747 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A060747 a(n) = A005408(n)-2 = A005843(n)-1 = -A000984(n)/A002420(n) = A001477(n)+A023443(n).
%F A060747 G.f.: (3*x - 1)/(1 - x)^2.
%F A060747 Abs(a(n)) = Sum_{k=0..n} (A078008(k) mod 4). - _Paul Barry_, Mar 12 2004
%F A060747 E.g.f.: exp(x)*(2*x-1). - _Paul Barry_, Mar 31 2007
%F A060747 a(n) = 2*a(n-1) - a(n-2); a(0)=-1, a(1)=1. - _Philippe Deléham_, Nov 03 2008
%F A060747 a(n) = 4*n - a(n-1) - 4 for n>0, with a(0)=-1. - _Vincenzo Librandi_, Aug 07 2010
%F A060747 a(n) = A161680(A005843(n))/n for n > 0. - _Stefano Spezia_, Feb 14 2025
%t A060747 Table[2*n - 1, {n, 0, 200}] (* _Vladimir Joseph Stephan Orlovsky_, Feb 16 2012 *)
%t A060747 LinearRecurrence[{2,-1},{-1,1},80] (* _Harvey P. Dale_, Mar 27 2020 *)
%o A060747 (Haskell)
%o A060747 a060747 = subtract 1 . (* 2)
%o A060747 a060747_list = [-1, 1 ..] -- _Reinhard Zumkeller_, Jul 05 2015
%o A060747 -- _Reinhard Zumkeller_, Jul 05 2015
%o A060747 (PARI) a(n)=2*n-1 \\ _Charles R Greathouse IV_, Sep 24 2015
%Y A060747 Cf. A000217, A000330, A000984, A001477, A002420, A005408, A005843, A016777, A023443, A040001, A048495, A078008, A145051, A146535, A161680.
%K A060747 sign,easy
%O A060747 0,3
%A A060747 _Henry Bottomley_, Apr 26 2001