A258193 -id:A258193 - cp's OEIS frontend

A258194 Positions of zeros in A258193.

1, 2, 3, 4, 8, 82, 107, 166, 178, 250, 298, 359, 490, 503, 514, 597, 634, 647, 730, 740, 756, 759, 850, 866, 908, 922, 928, 980, 1043, 1079, 1224, 1361, 1377, 1462, 1463, 1480, 1484, 1518, 1564, 1582, 1702, 1724, 1732, 1822, 1882, 1885, 1935, 1955, 1970, 2198

Offset: 1

Vladimir Shevelev and Peter J. C. Moses, May 23 2015

nonn

Reinhard Zumkeller, Table of n, a(n) for n = 1..100

Cf. A258193.

A258195 Define a<+>b = odd part(odd part(a) + odd part(b)), where odd part(n) = A000265(n); a(n) is not already appeared prime of the form <+>_{1<=i<=k}i with the smallest k, or a(n)=0 if there is no such k (see comment).

Original entry on oeis.org

3, 5, 7, 17, 19, 23, 11, 13, 53, 37, 47, 43, 29, 61, 31, 41, 83, 79, 73, 103, 137, 109, 113, 151, 149, 139, 193, 157, 167, 71, 199, 229, 179, 181, 223, 191, 107, 173, 97, 269, 241, 101, 59, 233, 197, 227, 251, 263, 89, 211, 239, 131, 293, 67, 307, 379, 277

Offset: 1

Vladimir Shevelev, May 23 2015

nonn

f(n)=<+>{1<=i<=n}i is defined by the following: f(1)=1, for n>=2, f(n)=f(n-1)<+>n.

Conjecture: the sequence is a permutation of the odd primes.

Peter J. C. Moses, Table of n, a(n) for n = 1..1000

Cf. A258193.

vSum[a_,b_]:=#[#[a]+#[b]]&[#/2^IntegerExponent[#,2]&];
DeleteDuplicates[Select[FoldList[vSum,0,Range[500]],PrimeQ]] (* Peter J. C. Moses, May 23 2015 *)

More terms from Peter J. C. Moses, May 23 2015

cp's OEIS Frontend

A258194 Positions of zeros in A258193.

Views

Author

Keywords

Links

Crossrefs

A258195 Define a<+>b = odd part(odd part(a) + odd part(b)), where odd part(n) = A000265(n); a(n) is not already appeared prime of the form <+>_{1<=i<=k}i with the smallest k, or a(n)=0 if there is no such k (see comment).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions