1,2

Table of n, a(n) for n=1..69.

# First load the Maple programs from A100549 and A100762

# Bgood = (is pp(n) = pp(B(n))), that is, is B(n) enough to establish pp(n)?

Bgood := proc(n) global pp;

`if`(pp(B(n))=pp(n), true, false);

end proc;

select(Bgood, [$1..200]);

Cf. A100549, A100762.

Sequence in context: A110262 A176693 A118672 * A333337 A070089 A069167

Adjacent sequences: A100414 A100415 A100416 * A100418 A100419 A100420

nonn

David Applegate and N. J. A. Sloane, Sep 15 2008

approved