login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A362438 a(n) = n^2 + 2^(n-1). 1
2, 6, 13, 24, 41, 68, 113, 192, 337, 612, 1145, 2192, 4265, 8388, 16609, 33024, 65825, 131396, 262505, 524688, 1049017, 2097636, 4194833, 8389184, 16777841, 33555108, 67109593, 134218512, 268436297, 536871812, 1073742785, 2147484672, 4294968385, 8589935748, 17179870409, 34359739664, 68719478105, 137438954916 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
REFERENCES
GCHQ, The GCHQ Puzzle Book, Penguin, 2016. See page 79.
LINKS
FORMULA
From Chai Wah Wu, Apr 23 2023: (Start)
a(n) = 5*a(n-1) - 9*a(n-2) + 7*a(n-3) - 2*a(n-4) for n > 4.
G.f.: x*(-x^3 + x^2 - 4*x + 2)/((x - 1)^3*(2*x - 1)). (End)
PROG
(Python)
def A362438(n): return n**2+(1<<n-1) # Chai Wah Wu, Apr 23 2023
CROSSREFS
See A001580 for another version.
Sequence in context: A178532 A003600 A283551 * A000135 A281865 A267698
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Apr 21 2023
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 2 08:27 EDT 2024. Contains 372178 sequences. (Running on oeis4.)