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!)
A214331 a(n) = (a(n-1) + a(n-3))/gcd(a(n-1), a(n-3)) with a(0) =2, a(1) = 3, a(2) = 5. 4

%I #7 Jul 26 2012 21:35:17

%S 2,3,5,7,10,3,10,2,5,3,5,2,5,2,2,7,9,11,18,3,14,16,19,33,49,68,101,

%T 150,109,210,12,121,331,343,464,795,1138,801,532,835,1636,542,1377,

%U 3013,3555,548,3561,2372,730,4291,6663,7393,11684,18347,25740,9356,27703,4111,13467,41170,45281,58748,49959,95240,38497,88456,22962,61459,149915,172877,234336,384251

%N a(n) = (a(n-1) + a(n-3))/gcd(a(n-1), a(n-3)) with a(0) =2, a(1) = 3, a(2) = 5.

%H N. J. A. Sloane, <a href="/A214331/b214331.txt">Table of n, a(n) for n = 0..10000</a>

%p t := [2, 3, 5];

%p for n from 4 to 1000 do

%p t:=[op(t), (t[n-1]+t[n-3])/gcd(t[n-1],t[n-3])];

%p od:

%p t;

%Y Cf. A214551.

%K nonn

%O 0,1

%A _N. J. A. Sloane_, Jul 26 2012

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 23 02:14 EDT 2024. Contains 371906 sequences. (Running on oeis4.)