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).

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,1

Comments

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.

Links

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

Mathematica

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

Crossrefs

Cf. A258193.

Sequence in context: A276044 A114265 A377939 * A110358 A038971 A210479

Adjacent sequences: A258192 A258193 A258194 * A258196 A258197 A258198

Keyword

nonn

Author

Vladimir Shevelev, May 23 2015

Extensions

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

Status

approved