Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072979
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072979 a(n) = sum_{k=1..n-1} gcd(k,n)a(k), a(1) = 1. +0
1
1, 1, 2, 5, 9, 28, 46, 136, 288, 722, 1238, 4342, 6818, 19146, 45026, 111698, 189506, 624930, 1003942, 3187170, 6659438, 15815050, 27669542, 98100426, 166371218, 437756198, 972187194, 2528368182, 4258122302, 14644463794, 23160708398 (list; graph; listen)
OFFSET

1,3

EXAMPLE

a(4) = gcd(1,4)a(1) + gcd(2,4)a(2) + gcd(3,4)a(3) = 1*1 + 2*1 + 1*2 = 5.

MATHEMATICA

f[n_] := f[n] = Sum[ GCD[k, n]*f[k], {k, 1, n - 1}]; f[1] = 1; Table[ f[n], {n, 1, 31} ]

CROSSREFS

Sequence in context: A136108 A026297 A109742 this_sequence A094600 A139796 A086586

Adjacent sequences: A072976 A072977 A072978 this_sequence A072980 A072981 A072982

KEYWORD

easy,nice,nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Aug 20 2002

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research