login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A141495
a(n) = 3*a(n-1) for n>2; a(0)=1, a(1)=3, a(2)=7.
3
1, 3, 7, 21, 63, 189, 567, 1701, 5103, 15309, 45927, 137781, 413343, 1240029, 3720087, 11160261, 33480783, 100442349, 301327047, 903981141, 2711943423, 8135830269, 24407490807, 73222472421, 219667417263, 659002251789
OFFSET
0,2
COMMENTS
A sequence of the form: a(0)=1, a(1)=prime(m), a(2)=prime(m+2), a(n)=a(1)*a(n-1).
a(n) is divisible by 7 for n>1. - Colin Barker, Jan 09 2014
FORMULA
a(n) = A082541(n-1), n>1. - R. J. Mathar, Aug 27 2008
a(n) = 7*3^(n-2) for n>1. a(n)=3*a(n-1) for n>2. G.f.: (2*x^2-1) / (3*x-1). - Colin Barker, Jan 09 2014
MATHEMATICA
a[0] = 1; a[1] = 3; a[2] = 7; a[n_] := a[n] = a[1]*a[n - 1]; Table[a[n], {n, 0, 30}]
Join[{1, 3}, NestList[3#&, 7, 30]] (* Harvey P. Dale, Aug 05 2024 *)
CROSSREFS
Cf. A084215. For other examples see A141496, etc.
Sequence in context: A148671 A148672 A148673 * A151412 A121797 A109361
KEYWORD
nonn,easy
AUTHOR
Roger L. Bagula, Aug 10 2008
EXTENSIONS
Edited by N. J. A. Sloane, Aug 16 2008
STATUS
approved