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!)
 A260410 Find smallest m such that A260409(m+1)-A260409(m) = n; then a(n) = A260409(m). 2
 3276, 21, 2, 18, 6, 5, 7, 44, 1, 3, 23, 30, 19, 16, 78, 10, 26, 27, 4, 183, 9, 57, 260, 58, 138, 84, 59, 80, 208, 281, 147, 476, 49, 11, 282, 192, 114, 290, 553, 222, 851, 1582, 1077, 293, 348, 15, 700, 155, 37, 1234, 1786, 93, 266, 1103 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS a(71) = 8027, a(73) = 1316, a(74) = 7785, a(75) = 5407, a(80) = 9809, a(81) = 1739, a(97) = 8972 & a(98) = 9750. In the first 9999 terms of the first differences of A260409, there are 2 zeros, 891 ones, 766 twos, etc. These can be computed by first running the Mmca in A260310 and then Tally@ Sort @ Differences[ Transpose[ lst][]] LINKS EXAMPLE a(0) = 35407 because A260409(3276) = A260409(3277) = 35407 and the difference is 0. a(8) = 8 because A260409(1) = 8 and A260409(2) = 16 and the difference is 8. a(9) = 18 because A260409(3) = 18 and A260409(4) = 27, which has a difference of 9. MATHEMATICA (* first run the Mmca in A260310 and then *) t = Transpose[lst][]; d = Differences[ Transpose[ lst][]]; p = Table[ Position[d, n, 1, 1], {n, 0, 69}] // Flatten; t[[#]] & /@ p CROSSREFS Cf. A260310, A260408, A260409. Sequence in context: A031820 A048959 A237085 * A223430 A307767 A307809 Adjacent sequences:  A260407 A260408 A260409 * A260411 A260412 A260413 KEYWORD nonn AUTHOR Robert G. Wilson v, Jul 24 2015 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 7 03:27 EDT 2020. Contains 334836 sequences. (Running on oeis4.)