login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A257892
Numbers n with property that A062234(n) = A062234(n+1) = A062234(n+2) = A062234(n+3).
7
332, 878, 1999, 3949, 4524, 5953, 6576, 8676, 10068, 11840, 17107, 17208, 19034, 19525, 46771, 46828, 52767, 54567, 54927, 56879, 58695, 61748, 65926, 77168, 77676, 79722, 92775, 92823, 96099, 101607, 111007, 136141, 160095, 160418, 173404
OFFSET
1,1
COMMENTS
a(n) = A258432(m), where m such that A258383(m) = 4. - Reinhard Zumkeller, May 31 2015
LINKS
EXAMPLE
a(1) = A258437(A258432(4)) = 332. - Reinhard Zumkeller, May 31 2015
PROG
(PARI) d(k) = 2*prime(k)-prime(k+1);
isok(n) = (d(n) == d(n+1)) && (d(n+1) == d(n+2)) && (d(n+2) == d(n+3)); \\ Michel Marcus, May 29 2015
(Perl) use Math::Prime::Util::PrimeArray; tie my @prime, "Math::Prime::Util::PrimeArray"; sub d { 2*$prime[$_[0]-1] - $prime[$_[0]] } for (1..1e6) { my $dk=d($_); say if d($_+1)==$dk && d($_+2)==$dk && d($_+3)==$dk } # Dana Jacobsen, May 31 2015
(Perl) use ntheory ":all"; { my @prime; sub d { 2*$prime[$_[0]-1] - $prime[$_[0]] } sub list { my $n=shift; @prime=@{primes(nth_prime($n+5))}; my @d=map{d($_)}1..4; my @list; for (1..$n) { push @list, $_ if $d[0]==$d[1] && $d[0]==$d[2] && $d[0]==$d[3]; @d=(@d[1..3], d($_+4)) } @list; } } say join ", ", list(1e6); # Dana Jacobsen, May 31 2015
(Haskell)
a257892 n = a257892_list !! (n-1)
a257892_list = map a258432 $ filter ((== 4) . a258383) [1..]
-- Reinhard Zumkeller, May 31 2015
CROSSREFS
Subsequence of A257762 and A062234.
Sequence in context: A376734 A250758 A114084 * A235020 A111690 A095199
KEYWORD
nonn
AUTHOR
Zak Seidov, May 14 2015
STATUS
approved