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!)
A335855 a(n) = a(a(n-1)) + a(floor(n/a(n-1))) with a(1) = a(2) = a(3) = a(4) = 2. 1
2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

MATHEMATICA

a[1] = a[2] = a[3] = a[4] = 2; a[n_] := a[n] = a[a[n-1]] + a[Floor[n / a[n-1]]]; Array[a, 100] (* Amiram Eldar, Jun 27 2020 *)

PROG

(PARI) a=vector(10^2); a[1]=a[2]=a[3]=a[4]=2; for(n=5, #a, a[n]=a[n\a[n-1]]+a[a[n-1]]); a

CROSSREFS

Cf. A004001, A283207.

Sequence in context: A080217 A157901 A327441 * A297824 A281796 A072376

Adjacent sequences:  A335852 A335853 A335854 * A335856 A335857 A335858

KEYWORD

nonn,easy

AUTHOR

Altug Alkan, Jun 27 2020

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 April 19 05:26 EDT 2021. Contains 343105 sequences. (Running on oeis4.)