login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007494 Numbers that are congruent to 0 or 2 mod 3. 75

%I #156 Apr 05 2024 10:04:03

%S 0,2,3,5,6,8,9,11,12,14,15,17,18,20,21,23,24,26,27,29,30,32,33,35,36,

%T 38,39,41,42,44,45,47,48,50,51,53,54,56,57,59,60,62,63,65,66,68,69,71,

%U 72,74,75,77,78,80,81,83,84,86,87,89,90,92,93,95,96,98,99,101,102,104,105,107

%N Numbers that are congruent to 0 or 2 mod 3.

%C The map n -> a(n) (where a(n) = 3n/2 if n even or (3n+1)/2 if n odd) was studied by Mahler, in connection with "Z-numbers" and later by Flatto. One question was whether, iterating from an initial integer, one eventually encountered an iterate = 1 (mod 4). - Jeff Lagarias, Sep 23 2002

%C Partial sums of 0,2,1,2,1,2,1,2,1,... . - _Paul Barry_, Aug 18 2007

%C a(n) = numbers k such that antiharmonic mean of the first k positive integers is not integer. A169609(a(n-1)) = 3. See A146535 and A169609. Complement of A016777. - _Jaroslav Krizek_, May 28 2010

%C Range of A173732. - _Reinhard Zumkeller_, Apr 29 2012

%C Number of partitions of 6n into two odd parts. - _Wesley Ivan Hurt_, Nov 15 2014

%C Numbers m such that 3 divides A000217(m). - _Bruno Berselli_, Aug 04 2017

%C Maximal length of a snake like polyomino that fits in a 2 X n rectangle. - _Alain Goupil_, Feb 12 2020

%D L. Flatto, Z-numbers and beta-transformations, in Symbolic dynamics and its applications (New Haven, CT, 1991), 181-201, Contemp. Math., 135, Amer. Math. Soc., Providence, RI, 1992.

%H Vincenzo Librandi, <a href="/A007494/b007494.txt">Table of n, a(n) for n = 0..10000</a>

%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=1002">Encyclopedia of Combinatorial Structures 1002</a>.

%H Attila Máder, <a href="http://www.model.u-szeged.hu/etc/edoc/imp/AMader/AMader.pdf">The Use of Experimental Mathematics in the Classroom</a>, in Interesting Mathematical Problems in Sciences and Everyday Life - 2011.

%H Kurt Mahler, <a href="https://carmamaths.org/resources/mahler/docs/167.pdf">An unsolved problem on the powers of 3/2</a>, J. Austral. Math. Soc., Vol. 8 (1968), pp. 313-321.

%H P. Sabinin and M. G. Stone, <a href="http://www.jstor.org/stable/2974558">Transforming n-gons by Folding the Plane</a>, Amer. Math. Monthly, Vol. 102, No. 7 (1995), pp. 620-627.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Folding.html">Folding</a>.

%H Robert G. Wilson v, <a href="/A007494/a007494.pdf">Notes with attachment</a>.

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1).

%F a(n) = 3*n/2 if n even, otherwise (3*n+1)/2.

%F If u(1)=0, u(n) = n + floor(u(n-1)/3), then a(n-1) = u(n). - _Benoit Cloitre_, Nov 26 2002

%F G.f.: x*(x+2)/((1-x)^2*(1+x)). - _Ralf Stephan_, Apr 13 2002

%F a(n) = 3*floor(n/2) + 2*(n mod 2) = A032766(n) + A000035(n). - _Reinhard Zumkeller_, Apr 04 2005

%F a(n) = (6*n+1)/4 - (-1)^n/4; a(n) = Sum_{k=0..n-1} (1 + (-1)^(k/2)*cos(k*Pi/2)). - _Paul Barry_, Aug 18 2007

%F A145389(a(n)) <> 1. - _Reinhard Zumkeller_, Oct 10 2008

%F a(n) = A002943(n) - A173511(n). - _Reinhard Zumkeller_, Feb 20 2010

%F a(n) = 3*n - a(n-1) - 1 (with a(0)=0). - _Vincenzo Librandi_, Nov 18 2010

%F a(n) = Sum_{k>=0} A030308(n,k)*A042950(k). - _Philippe Deléham_, Oct 17 2011

%F a(n) = n + ceiling(n/2). - _Arkadiusz Wesolowski_, Sep 18 2012

%F a(n) = 2n - floor(n/2) = floor((3n+1)/2) = n + (n + (n mod 2))/2. - _Wesley Ivan Hurt_, Oct 19 2013

%F a(n) = A000217(n+1) - A099392(n+1). - _Bui Quang Tuan_, Mar 27 2015

%F a(n) = n + floor(n/2) + (n mod 2). - _Bruno Berselli_, Apr 04 2016

%F a(n) = Sum_{i=1..n} numerator(2/i). - _Wesley Ivan Hurt_, Feb 26 2017

%F a(n) = Sum_{k=0..n-1} Sum_{i=0..k} C(i,k)+(-1)^(k-i). - _Wesley Ivan Hurt_, Sep 20 2017

%F E.g.f.: (3*exp(x)*x + sinh(x))/2. - _Stefano Spezia_, Feb 11 2020

%F Sum_{n>=1} (-1)^(n+1)/a(n) = log(3)/2 - Pi/(6*sqrt(3)). - _Amiram Eldar_, Dec 04 2021

%p a[0]:=0:a[1]:=2:for n from 2 to 100 do a[n]:=a[n-2]+3 od: seq(a[n], n=0..71); # _Zerinvary Lajos_, Mar 16 2008

%p A007494:=n->floor((3*n+1)/2); seq(A007494(k), k=0..100); # _Wesley Ivan Hurt_, Sep 27 2013

%t Flatten[{#,#+2}&/@(3Range[0,40])] (* _Harvey P. Dale_, May 15 2011 *)

%t Table[2n - Floor[n/2], {n,0,100}] (* _Wesley Ivan Hurt_, Sep 27 2013 *)

%o (PARI) a(n)=n+(n+1)>>1 \\ _Charles R Greathouse IV_, Jul 25 2011

%o (Magma) [(6*n+1)/4-(-1)^n/4: n in [0..80]]; // _Vincenzo Librandi_, Aug 20 2011

%o (Haskell)

%o a007494 = flip div 2 . (+ 1) . (* 3) -- _Reinhard Zumkeller_, Dec 12 2014

%Y Cf. A000217, A001651, A032766, A035361, A063574, A132462.

%Y Complement of A016777.

%Y Range of A002517.

%Y Cf. A274406. [_Bruno Berselli_, Jun 26 2016]

%K nonn,easy,changed

%O 0,2

%A Christopher Lam Cham Kee (Topher(AT)CyberDude.Com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 08:45 EDT 2024. Contains 371782 sequences. (Running on oeis4.)