login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A247206 a(n) = round(prime(n)/A245085(n)). 1

%I

%S 1,1,4,2,3,5,3,6,3,3,7,4,5,5,15,4,10,9,10,6,5,10,5,8,6,12,11,11,6,12,

%T 12,8,9,9,9,8,11,12,6,14,7,5,25,15,7,10,14,38,10,16,11,9,12,18,10,17,

%U 7,12,9,12,38,16,17,16,10,13,35,10,25,72,13,29,20,8

%N a(n) = round(prime(n)/A245085(n)).

%C Does every positive integer occur at least once? Does every positive integer occur only finitely often?

%H Peter J. C. Moses, <a href="/A247206/b247206.txt">Table of n, a(n) for n = 3..2002</a>

%t Table[ans={};

%t Round[Prime[n]/(NestWhile[#+1&,2,(AppendTo[ans,Mod[#!,Prime[n]]];(Length[ans]<Prime[n]-1)&&(Max[Last[Transpose[Tally[ans]]]]==1))&]-1)],{n,3,50}] (* _Peter J. C. Moses_, Nov 26 2014 *)

%Y Cf. A000040, A247190, A245085.

%K nonn

%O 3,3

%A _Vladimir Shevelev_, Nov 25 2014

%E More terms from _Peter J. C. Moses_, Nov 25 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 19:53 EDT 2019. Contains 328319 sequences. (Running on oeis4.)