Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131133
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131133 a(0)=1; for n>0, a(n) = (1/n + 1/a(n-1))*LCM(n,a(n-1)). +0
2
1, 2, 2, 5, 9, 14, 10, 17, 25, 34, 22, 3, 5, 18, 16, 31, 47, 64, 41, 60, 4, 25, 47, 70, 47, 72, 49, 76, 26, 55, 17, 48, 5, 38, 36, 71, 107, 144, 91, 10, 5, 46, 44, 87, 131, 176, 111, 158, 103, 152, 101, 152, 51, 104, 79, 134, 95, 8, 33, 92, 38, 99, 161, 32, 3, 68, 67, 2, 35, 104 (list; graph; listen)
OFFSET

0,2

COMMENT

Equivalently, a(0)=1 ; a(n)=(a(n-1)+n)/GCD(n,a(n-1)). - Ctibor O. ZIZKA (ctibor.zizka(AT)seznam.cz), Feb 15 2008

MAPLE

a[0] := 1; for n to 70 do a[n] := (1/n+1/a[n-1])*lcm(n, a[n-1]) end do; seq(a[n], n = 0 .. 70) - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 21 2007

CROSSREFS

Cf. A131134.

Sequence in context: A076949 A040009 A011273 this_sequence A096569 A076607 A054229

Adjacent sequences: A131130 A131131 A131132 this_sequence A131134 A131135 A131136

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Jun 17 2007

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 21 2007

Edited by njas, May 16 2008 at the suggestion of R. J. Mathar.

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research