login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
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, 150, 109, 210, 12, 121, 331, 343, 464, 795, 1138, 801, 532, 835, 1636, 542, 1377, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

N. J. A. Sloane, Table of n, a(n) for n = 0..10000

MAPLE

t := [2, 3, 5];

for n from 4 to 1000 do

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

od:

t;

CROSSREFS

Cf. A214551.

Sequence in context: A076387 A193622 A265249 * A182483 A308818 A323013

Adjacent sequences:  A214328 A214329 A214330 * A214332 A214333 A214334

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jul 26 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 6 14:04 EDT 2020. Contains 334827 sequences. (Running on oeis4.)