Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125596
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125596 a(1)=1. a(n) = sum{1<=k<n, GCD(k,n(n+1))=1} a(k). +0
2
1, 1, 1, 2, 1, 2, 3, 5, 4, 9, 5, 10, 12, 18, 21, 48, 22, 44, 48, 88, 84, 197, 92, 183, 260, 432, 441, 908, 183, 366, 1178, 1800, 1778, 3743, 1541, 3346, 5627, 8913, 7159, 16638, 7429, 14858, 24107, 38702, 38615, 88520, 40509, 79474, 88596, 167790, 169580 (list; graph; listen)
OFFSET

1,4

LINKS

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

EXAMPLE

The positive integers < 8 and coprime to 8 and 9 are 1,5,7. So a(8) = a(1)+a(5)+a(7) = 1+1+3 = 5.

MATHEMATICA

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

CROSSREFS

Cf. A125597.

Sequence in context: A127462 A106436 A075758 this_sequence A132405 A057192 A078777

Adjacent sequences: A125593 A125594 A125595 this_sequence A125597 A125598 A125599

KEYWORD

nonn

AUTHOR

Leroy Quet 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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research