Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123274
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123274 a(0)=a(1)=a(2) = 1. a(n) = (a(n-1) +a(n-2)) /GCD(a(n-1)+a(n-2),a(n-3)), for n >= 3. +0
1
1, 1, 1, 2, 3, 5, 4, 3, 7, 5, 4, 9, 13, 11, 8, 19, 27, 23, 50, 73, 123, 98, 221, 319, 270, 589, 859, 724, 1583, 2307, 1945, 4252, 6197, 10449, 8323, 18772, 27095, 45867, 36481, 82348, 118829, 201177, 160003, 361180, 521183, 882363, 701773, 1584136, 2285909 (list; graph; listen)
OFFSET

0,4

MATHEMATICA

f[l_List] := Append[l, (l[[ -1]] + l[[ -2]])/GCD[l[[ -1]] + l[[ -2]], l[[ -3]]]]; Nest[f, {1, 1, 1}, 46] (*Chandler*)

CROSSREFS

Adjacent sequences: A123271 A123272 A123273 this_sequence A123275 A123276 A123277

Sequence in context: A058981 A117339 A096016 this_sequence A023818 A102149 A104204

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Oct 10 2006

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 17 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research