Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125597
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125597 a(1)=1. a(n) = sum{1<=k<n, GCD(k,n(n+1)/2)=1} a(k). +0
2
1, 1, 1, 2, 4, 8, 6, 11, 21, 51, 11, 22, 133, 159, 151, 328, 707, 1414, 880, 1732, 3850, 9482, 1742, 3480, 22126, 37243, 25604, 51381, 102087, 204174, 157324, 285010, 660221, 1285026, 262885, 547906, 3664304, 5844380, 3927062, 8543954, 19956539 (list; graph; listen)
OFFSET

1,4

EXAMPLE

The positive integers < 8 and coprime to 8*9/2 = 36 are 1,5,7. So a(8) = a(1)+a(5)+a(7) = 1+4+6 = 11.

MATHEMATICA

f[l_List] := Block[{n = Length[l] + 1}, Append[l, Plus @@ l[[Select[Range[n - 1], GCD[ #, n*(n + 1)/2] == 1 &]]]]]; Nest[f, {1}, 40] (*Chandler*)

CROSSREFS

Cf. A125596.

Adjacent sequences: A125594 A125595 A125596 this_sequence A125598 A125599 A125600

Sequence in context: A138284 A022478 A121711 this_sequence A109554 A140692 A048640

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Nov 26 2006

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 26 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 08:31 EDT 2008. Contains 144667 sequences.


AT&T Labs Research