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!)
A353240 a(0) = 1; for n > 0, a(n) = A109812(n) + A109812(n+1). 2
1, 3, 6, 7, 11, 13, 15, 26, 22, 15, 27, 30, 29, 31, 46, 39, 31, 57, 53, 31, 47, 55, 59, 61, 55, 47, 61, 63, 79, 86, 63, 107, 91, 63, 103, 91, 63, 109, 95, 119, 123, 95, 103, 63, 95, 111, 124, 119, 127, 216, 157, 127, 227, 159, 127, 227, 175, 127, 214, 174, 111 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
N. J. A. Sloane, Table of n, a(n) for n = 0..20000 (first 10000 terms from Rémy Sigrist)
Rémy Sigrist, C++ program.
EXAMPLE
a(7) = A109812(7) + A109812(8) = 10 + 16 = 26.
PROG
(C++) See Links section.
CROSSREFS
Sequence in context: A022550 A237883 A153033 * A282167 A076644 A214961
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Apr 08 2022
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 April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)