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!)
A301729 a(0)=1; thereafter positive numbers that are congruent to {0, 1, 3, 5} mod 6. 2

%I #16 Dec 31 2021 05:47:25

%S 1,1,3,5,6,7,9,11,12,13,15,17,18,19,21,23,24,25,27,29,30,31,33,35,36,

%T 37,39,41,42,43,45,47,48,49,51,53,54,55,57,59,60,61,63,65,66,67,69,71,

%U 72,73,75,77,78,79,81,83,84,85,87,89,90,91,93,95,96,97

%N a(0)=1; thereafter positive numbers that are congruent to {0, 1, 3, 5} mod 6.

%H A. V. Shutov, <a href="http://mi.mathnet.ru/eng/znsl933">The number of words of a given length in the planar crystallographic groups</a>, (in Russian), Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI), Vol. 302 (2003), Anal. Teor. Chisel i Teor. Funkts. 19, pp. 188-197, 203; <a href="https://doi.org/10.1007/s10958-005-0329-2">translation</a>, in J. Math. Sci. (N.Y.), Vol. 129, No. 3 (2005), pp. 3922-3926 [MR2023041]. See Table 1, line "p31m".

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

%p f:= proc(n) if n=0 then 1

%p elif (n mod 4) = 0 then (3*n)/2

%p elif (n mod 4) = 1 then (3*n-1)/2

%p elif (n mod 4) = 2 then (3*n)/2

%p else (3*n+1)/2 fi;

%p end;

%p s1 := [seq(f(n),n=0..70)];

%t Join[{1}, Select[Range[100], MemberQ[{0, 1, 3, 5}, Mod[#,6]] &]] (* _Amiram Eldar_, Dec 31 2021 *)

%Y Essentially the same as A047273.

%K nonn

%O 0,3

%A _N. J. A. Sloane_, Mar 30 2018

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 May 2 04:48 EDT 2024. Contains 372178 sequences. (Running on oeis4.)