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!)
A350127 a(n) = a(a(n-1)) mod 3 + a(n-2) with a(0) = 0 and a(1) = 1. 1
0, 1, 1, 2, 2, 3, 4, 5, 4, 7, 6, 8, 7, 10, 7, 12, 8, 13, 9, 14, 10, 14, 11, 16, 13, 17, 14, 18, 14, 19, 16, 21, 18, 21, 20, 22, 22, 24, 23, 25, 25, 27, 25, 29, 26, 31, 26, 33, 26, 35, 27, 35, 28, 37, 28, 39, 29, 40, 30, 41, 30, 42, 31, 42, 32, 42, 33, 42, 34 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
It appears that lim_{n->infinity} a(n)/n = 0.562...
Are there infinitely many k such that a(k) = a(k+1)?
Conjecture: The density of even terms is 1/2.
LINKS
MATHEMATICA
a[0] = 0;
a[1] = 1;
a[n_] := a[n] = Mod[a[a[n - 1]], 3] + a[n - 2]
Array[a, 100, 0]
PROG
(Python)
a = [0, 1]
[a.append(a[a[n-1]]%3 + a[n-2]) for n in range(2, 69)]
print(a) # Michael S. Branicky, Dec 15 2021
CROSSREFS
Cf. A350126.
Sequence in context: A292259 A241397 A331049 * A320159 A342879 A342880
KEYWORD
nonn,look
AUTHOR
Jon Maiga, Dec 15 2021
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 July 21 14:09 EDT 2024. Contains 374474 sequences. (Running on oeis4.)