login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A283207 a(n) = a(floor(n/a(n-1))) + a(floor(n/a(n-2))) with a(1) = a(2) = 2. 1
2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 8, 6, 4, 6, 6, 4, 8, 6, 6, 8, 6, 6, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

For the first 10^6 terms, the maximum value of a(n) is 64 and the values of b(n) = least k such that a(k) = 2*n are 1, 3, 13, 12, 105, 97, 126, 96, 1681, 1552, 1746, 1537, 1734, 1926, 4050, 1536, 53793, 49665, 53890, 49185, 53862, 57024, 55616, 49153, 55488, 55302, 81249, 61446, 83619, 115214, 162000, 49152; note that b(2^n) = 3*2^((n+2)*(n-1)/2) for n = 1 to 5.

LINKS

Altug Alkan, Table of n, a(n) for n = 1..10000

Altug Alkan, Alternative Graph of A283207

Rémy Sigrist, Scatterplot of the first 2^34 terms

EXAMPLE

a(5) = 4 because a(5) = a(floor(5/a(4))) + a(floor(5/a(3))) = a(floor(5/4)) + a(floor(5/4)) = a(1) + a(1) = 4.

MATHEMATICA

a[1] = a[2] = 2; a[n_] := a[n] = a[Floor[n/a[n - 1]]] + a[Floor[n/a[n - 2]]]; Array[a, 120] (* Michael De Vlieger, Mar 06 2017 *)

PROG

(PARI) a=vector(100); a[1]=a[2]=2; for(n=3, #a, a[n]=a[n\a[n-1]]+a[n\a[n-2]]); a

CROSSREFS

Cf. A005185.

Sequence in context: A071805 A063511 A334789 * A164717 A164715 A164632

Adjacent sequences:  A283204 A283205 A283206 * A283208 A283209 A283210

KEYWORD

nonn

AUTHOR

Altug Alkan, Mar 03 2017

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 10:57 EDT 2020. Contains 334592 sequences. (Running on oeis4.)