login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001598 Number of terms in {b(1)..b(n)} relatively prime to b(n), where b(n) = A001597(n).
(Formerly M2244 N0891)
1

%I M2244 N0891 #18 Feb 01 2022 23:32:40

%S 1,1,1,3,2,5,5,4,2,9,5,8,5,13,12,8,5,17,8,6,11,14,11,23,7,23,26,11,16,

%T 14,15,31,10,28,16,24,15,37,9,39,16,20,27,20,31,14,43,47,23,32,20,51,

%U 17,14,54,24,30,28,27,40,57,61,20,56,26,42,30,28,68,22

%N Number of terms in {b(1)..b(n)} relatively prime to b(n), where b(n) = A001597(n).

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H T. D. Noe, <a href="/A001598/b001598.txt">Table of n, a(n) for n = 1..1000</a>

%H H. W. Gould, <a href="http://www.fq.math.ca/Scanned/8-3/advanced8-3.pdf">Problem H-170</a>, Fib. Quart., 8 (1970), p. 268.

%t nn = 10^4; t = Join[{1}, Union[Flatten[Table[n^i, {i, Prime[Range[PrimePi[Log[2, nn]]]]}, {n, 2, nn^(1/i)}]]]]; Table[Count[GCD[Take[t, n], t[[n]]], 1], {n, Length[t]}] (* _T. D. Noe_, Aug 09 2012 *)

%K nonn,easy

%O 1,4

%A _N. J. A. Sloane_

%E a(1) added by _T. D. Noe_, Aug 09 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)