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!)
A309974 a(1) = a(2) = a(3) = 1; a(n) = round((2*n-a(n-1)-a(n-2))/a(n-3)) for n > 3. 1

%I #16 Sep 08 2022 08:46:22

%S 1,1,1,6,3,3,1,4,4,12,2,3,2,12,5,8,2,5,4,16,4,6,2,10,6,18,3,6,3,17,7,

%T 13,3,7,5,20,7,10,3,10,7,22,6,9,3,13,9,25,5,8,4,18,11,20,4,8,5,26,11,

%U 17,4,9,7,28,11,13,4,11,9,30,9,12,4,15,11,32,7,11,4,21,12,33,6,11,5

%N a(1) = a(2) = a(3) = 1; a(n) = round((2*n-a(n-1)-a(n-2))/a(n-3)) for n > 3.

%H Altug Alkan, <a href="/A309974/b309974.txt">Table of n, a(n) for n = 1..10000</a>

%H Rémy Sigrist, <a href="/A309974/a309974.png">Colored scatterplot of the first 30000 terms</a> (where the color is function of n mod 6)

%o (PARI) q=vector(100); q[1]=q[2]=q[3]=1; for(n=4, #q, q[n]=round((2*n-q[n-1]-q[n-2])/q[n-3])); q

%o (Magma) I:=[1,1,1]; [n le 3 select I[n] else Round((2*n-Self(n-1)-Self(n-2))/Self(n-3)):n in [1..80]]; // _Marius A. Burtea_, Aug 25 2019

%Y Cf. A308622, A309971.

%K nonn,easy,look

%O 1,4

%A _Altug Alkan_ and _Rémy Sigrist_, Aug 25 2019

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 10 16:16 EDT 2024. Contains 372387 sequences. (Running on oeis4.)