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!)
A246789 a(n) = A246778(A005669(n)). 1

%I #10 Oct 17 2014 23:44:55

%S 2,2,4,9,18,19,34,39,42,44,74,82,87,96,129,149,150,157,184,184,194,

%T 219,259,265,293,326,343,343,370,374,418,422,441,463,468,509,539,542,

%U 548,573,627,645,659,670,671,671,687,693,708,718,750,753,771,787,845,884,904,952,999,1040,1055,1169,1193,1193,1428,1446,1475,1547,1552,1579,1590,1601,1604,1657,1704

%N a(n) = A246778(A005669(n)).

%C Conjecture: prime(A005669(n))^(1+1/A005669(n)) - prime(A005669(n)) is a strictly increasing function of n.

%C The truth of the conjecture would imply that "this sequence is an increasing sequence" which is another conjecture not equivalent to the first conjecture.

%C Note that if n is in the set {1, 19, 27, 45, 63} then a(n) = a(n+1) but there is no n, where n is less than 75 and a(n+1) < a(n).

%Y Cf. A000040, A002386, A005669, A246776, A246777, A246778.

%K nonn,hard

%O 1,1

%A _Farideh Firoozbakht_, Oct 08 2014

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 August 10 13:27 EDT 2024. Contains 375056 sequences. (Running on oeis4.)