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!)
A174332 Least prime q of which prime(n) is a proper binary substring. 4

%I #12 Feb 13 2021 22:58:41

%S 5,7,11,23,23,29,71,79,47,59,127,101,83,107,191,107,239,251,269,199,

%T 293,317,167,179,353,229,359,431,439,227,383,263,787,557,599,607,631,

%U 419,1447,347,359,727,383,449,709,797,467,479,739,919,467,479,967,503,769

%N Least prime q of which prime(n) is a proper binary substring.

%C a(n) = A208238(A000040(n)) = A208241(A000040(n)). - _Reinhard Zumkeller_, Feb 14 2013

%H Reinhard Zumkeller, <a href="/A174332/b174332.txt">Table of n, a(n) for n = 1..10000</a>

%e a(1)=5 since 2_10 = 10_2 is a substring of 5_10 = 101_2.

%t f[n_] := Block[{k = n + 1, p = StringTake[ ToString@ IntegerDigits[ Prime@n, 2], {2, -2}]}, While[q = StringTake[ ToString@ IntegerDigits[ Prime@k, 2], {2, -2}]; StringPosition[q, p] == {}, k++ ]; Prime@k]; Array[f, 55]

%o (Haskell)

%o a174332 = a208238 . a000040 -- _Reinhard Zumkeller_, Feb 14 2013

%Y Cf. A000040, A004676, A007088.

%K base,nonn

%O 1,1

%A _Robert G. Wilson v_, Mar 15 2010

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 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)