Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056144
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056144 a(1) = 1, a(m+1) = sum_{k=1 to m}[GCD(m, a(k))]. +0
1
1, 1, 2, 3, 5, 9, 11, 7, 9, 27, 15, 21, 25, 13, 27, 49, 17, 33, 59, 19, 33, 69, 53, 45, 47, 61, 39, 117, 47, 29, 89, 31, 33, 161, 51, 75, 105, 37, 57, 159, 65, 41, 135, 43, 85, 251, 91, 139, 89, 127, 127, 171, 113, 157, 199, 131, 93, 227, 87, 117, 185, 121, 123, 227, 65 (list; graph; listen)
OFFSET

1,3

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

a(7) = GCD(6,1) + GCD(6,1) + GCD(6,2) + GCD(6,3) + GCD(6,5) + GCD(6,9) = 1 + 1 + 2 + 3 + 1 + 3 = 11.

CROSSREFS

Sequence in context: A057242 A090845 A058108 this_sequence A078645 A067139 A014657

Adjacent sequences: A056141 A056142 A056143 this_sequence A056145 A056146 A056147

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Aug 04 2000

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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research