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!)
A080667 a(1)=3; for n>1, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+3 otherwise. 0
3, 6, 10, 13, 16, 20, 23, 26, 29, 33, 36, 39, 43, 46, 49, 53, 56, 59, 62, 66, 69, 72, 76, 79, 82, 86, 89, 92, 96, 99, 102, 105, 109, 112, 115, 119, 122, 125, 129, 132, 135, 138, 142, 145, 148, 152, 155, 158, 162, 165, 168, 171, 175, 178, 181, 185, 188 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, arXiv:math/0305308 [math.NT], 2003.
FORMULA
a(n) = floor(n*r + 1/(1+r)) where r = (3 + sqrt(13))/2.
MATHEMATICA
a[1] = 3; a[n_] := a[n] = a[n-1] + If[MemberQ[Array[a, n-1], n], 4, 3];
Array[a, 60] (* Jean-François Alcover, Nov 25 2018 *)
CROSSREFS
Sequence in context: A028433 A310051 A353093 * A277722 A190007 A310052
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Mar 23 2003
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 27 07:58 EDT 2024. Contains 372009 sequences. (Running on oeis4.)