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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A318873 First differences of A316156. 2
 1, 1, 3, 1, 1, 1, 4, 2, 2, 1, 1, 1, 11, 1, 7, 1, 3, 12, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 13, 19, 1, 1, 1, 1, 1, 1, 7, 17, 1, 1, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 8, 1, 1, 1, 20, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 25 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Antti Karttunen, Table of n, a(n) for n = 1..20000 FORMULA a(n) = A316156(n+1) - A316156(n). PROG (PARI) up_to = 20000; povisin(v, n) = { forstep(j=n, 1, -1, if(v[j] == n, return(j))); (0); }; \\ Here: povisin = position_of_n_in_strictly_increasing_v A318873list(up_to) = { my(v316156 = vector(1+up_to), v318872 = vector(1+up_to), v318873 = vector(up_to), k, s); v316156[1] = v318872[1] = 1; for(n=2, up_to+1, k = 1+v316156[n-1]; if(povisin(v316156, n-1), s = v318872[n-1]; while((s+k)%(n-1), k++)); v316156[n] = k; v318872[n] = v318872[n-1] + v316156[n]; v318873[n-1] = v316156[n] - v316156[n-1]); (v318873); }; v318873 = A318873list(up_to); A318873(n) = v318873[n]; CROSSREFS Cf. A316156. Sequence in context: A270825 A059619 A098950 * A295924 A123940 A339969 Adjacent sequences:  A318870 A318871 A318872 * A318874 A318875 A318876 KEYWORD nonn AUTHOR Antti Karttunen, Sep 16 2018 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.

Last modified June 14 20:21 EDT 2021. Contains 345038 sequences. (Running on oeis4.)