The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A318970 a(1) = 3; for n > 1, a(n) = 2^(a(n-1) - 1) + 5. 2
 3, 9, 261, 1852673427797059126777135760139006525652319754650249024631321344126610074238981 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) divides a(n+1) for n <= 4, but it is unknown if this divisibility holds for larger n. In other words, it is unknown if this sequence is a subsequence of A245594. Modulo any m > 1, the sequence stabilizes within the first A227944(m) <= log_2(m) terms. That is, for any n >= A227944(m), we have a(n) == a(A227944(m)) == A318989(m) (mod m). It follows that the prime divisors of the terms (cf. A318971) are very sparse: if prime p does not divide any of the first log_2(p) terms, then p does not divide any term. LINKS Max Alekseyev, Iterations of 2^(n-1)+5: the strong law of small numbers, or something bigger?, MathOverflow, 2016. MATHEMATICA RecurrenceTable[{a[1]==3, a[n]==2^(a[n-1] - 1) + 5}, a, {n, 4}] (* Vincenzo Librandi, Sep 07 2018 *) PROG (MAGMA) [n le 1 select 3 else 2^(Self(n-1)-1)+5: n in [1..4]]; // Vincenzo Librandi, Sep 07 2018 CROSSREFS Cf. A245594, A318971, A318989. Sequence in context: A073889 A332586 A211898 * A132516 A328125 A128450 Adjacent sequences:  A318967 A318968 A318969 * A318971 A318972 A318973 KEYWORD nonn AUTHOR Max Alekseyev, Sep 06 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 12 08:13 EDT 2021. Contains 344943 sequences. (Running on oeis4.)