Algorithms/Sequences/FermatPrimesSequence.cs

using System.Collections.Generic;
using System.Linq;
using System.Numerics;

namespace Algorithms.Sequences;

//github.com/ <summary>
//github.com/     <para>
//github.com/         Sequence of Fermat primes: primes of the form 2^(2^k) + 1, for some k >= 0.
//github.com/     </para>
//github.com/     <para>
//github.com/         Wikipedia: https://wikipedia.org/wiki/Fermat_number.
//github.com/     </para>
//github.com/     <para>
//github.com/         OEIS: https://oeis.org/A019434.
//github.com/     </para>
//github.com/ </summary>
public class FermatPrimesSequence : ISequence
{
    //github.com/ <summary>
    //github.com/ Gets sequence of Fermat primes.
    //github.com/ </summary>
    public IEnumerable<BigInteger> Sequence
    {
        get
        {
            var fermatNumbers = new FermatNumbersSequence().Sequence.Take(5);

            foreach (var n in fermatNumbers)
            {
                yield return n;
            }
        }
    }
}