Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135268
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135268 a(0) = 1; a(n) = a(n-1)+n-gcd(n,a(n-1)). +0
1
1, 1, 2, 4, 4, 8, 12, 18, 24, 30, 30, 40, 48, 60, 72, 84, 96, 112, 128, 146, 164, 184, 204, 226, 248, 272, 296, 322, 336, 364, 392, 422, 452, 484, 516, 550, 584, 620, 656, 694, 732, 772, 812, 854, 896, 940, 984, 1030, 1076, 1124, 1172 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n)=c*n*(n-1), where c ~ 0.48....

EXAMPLE

a(8)=18+8-gcd(8,18)=18+8-2=24.

MAPLE

a[0]:=1: for n to 50 do a[n]:=a[n-1]+n-gcd(n, a[n-1]) end do: seq(a[n], n=0.. 50); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 28 2008

CROSSREFS

Adjacent sequences: A135265 A135266 A135267 this_sequence A135269 A135270 A135271

Sequence in context: A055946 A130124 A076342 this_sequence A131771 A047073 A069753

KEYWORD

easy,nonn

AUTHOR

Ctibor O. ZIZKA (ctibor.zizka(AT)seznam.cz), Feb 15 2008, Feb 21 2008

EXTENSIONS

Corrected and extended by Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 28 2008

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research