A325056 -id:A325056 - cp's OEIS frontend

A324792 First differences of A325056: distance in A076042 from n-th low point to the next.

5, 5, 9, 15, 25, 45, 77, 133, 231, 401, 693, 1201, 2081, 3603, 6241, 10809, 18723, 32429, 56169, 97287, 168505, 291861, 505517, 875581, 1516551, 2626743, 4549653, 7880231, 13648959, 23640691, 40946879, 70922073, 122840635, 212766221, 368521905, 638298663

Offset: 0

N. J. A. Sloane, Sep 04 2019

nonn

Giovanni Resta, Table of n, a(n) for n = 0..41

Cf. A076042, A325056, A324791.

If we use primes instead of squares we get A008348, A309226, A324782, A324783.

a=b=c=d=n=0; L={0}; While[Length[L] < 22, n++; a=b; b=c; c=d; d=c + If[c < n^2, n^2, -n^2]; If[a > b < c < d, AppendTo[L, n-2]]]; Differences@ L (* Giovanni Resta, Oct 01 2019 *)

More terms from Giovanni Resta, Oct 01 2019

A076042 a(0) = 0; thereafter a(n) = a(n-1) + n^2 if a(n-1) < n^2, otherwise a(n) = a(n-1) - n^2.

Original entry on oeis.org

0, 1, 5, 14, 30, 5, 41, 90, 26, 107, 7, 128, 272, 103, 299, 74, 330, 41, 365, 4, 404, 845, 361, 890, 314, 939, 263, 992, 208, 1049, 149, 1110, 86, 1175, 19, 1244, 2540, 1171, 2615, 1094, 2694, 1013, 2777, 928, 2864, 839, 2955, 746, 3050, 649, 3149

Offset: 0

Amarnath Murthy, Oct 29 2002

Does not return to zero within first 2^25000 =~ 10^7525 terms.  Define an epoch as an addition followed by a sequence of (addition, subtraction) pairs.  The first epoch has length 1 (+), the second 3 (++-), the third 5 (++-+-), and so forth (cf. A324792).  The epoch lengths increase geometrically by about the square root of 3, and the value at the end of each epoch is the low value in the epoch.  These observations lead to the Python program given. - Tomas Rokicki, Aug 31 2019
Using the Maple program in A324791, I confirmed that a(n) != 0 for 0 < n < 10^2394. See the a- and b-files in A325056 and A324791. - N. J. A. Sloane, Oct 03 2019
'Easy Recamán transform' of the squares. - Daniel Forgues, Oct 25 2019

Tomas Rokicki, Table of n, a(n) for n = 0..20000

Cf. A076039, A003462, A076041, A046901.
See also A325056, A324791, A324792.
Cf. A053461 ('Recamán transform' of the squares).
Cf. A000290, A008344, A008345.

a:= proc(n) option remember; `if`(n<0, 0,
      ((s, t)-> s+`if`(sAlois P. Heinz, Jan 11 2020

a[0] = 0;
a[n_] := a[n] = a[n-1] + If[a[n-1] < n^2, n^2, -n^2];
a /@ Range[0, 50] (* Jean-François Alcover, Apr 11 2020 *)

v=vector(50); v[1]=1; for(n=2,50,if(v[n-1]

More terms from Ralf Stephan, Mar 20 2003
a(0)=0 prepended, at the suggestion of Allan C. Wechsler, by N. J. A. Sloane, Aug 31 2019
Offset set to 0, to cohere with previous action of N. J. A. Sloane, by Allan C. Wechsler, Sep 08 2019

A324791 Value of A076042 at its n-th low point.

Original entry on oeis.org

0, 5, 7, 4, 19, 104, 74, 193, 515, 725, 241, 1948, 2948, 709, 8746, 16451, 48443, 47915, 61369, 41566, 136585, 710582, 476516, 1363747, 3165833, 5491067, 11906702, 15854273, 6895924, 38766838, 63676139, 3935833, 209116033, 219826349, 265573243, 263220940

Offset: 0

N. J. A. Sloane, Sep 04 2019

nonn

N. J. A. Sloane, Table of n, a(n) for n = 0..4000 (Terms through a(42) from Giovanni Resta)
N. J. A. Sloane, Table of n, a(n) for n = 0..10001

Cf. A076042, A325056, A324792.

If we use primes instead of squares we get A008348, A309226, A324782, A324783.

# Maple program from N. J. A. Sloane, Oct 03 2019; guessb = A325056, guessc = A324791 (this sequence).
Digits := 64;
f := proc(k,M) local j1, twoL, RL, kprime, Mprime;
j1 := 3*k^2+7*k+17/4+2*M;
if issqr(j1) then lprint("Beware, perfect square: k,M,j1 are ",k,M,j1); fi;
twoL := -k-3/2+evalf(sqrt(j1)) ;
RL := floor(twoL/2);
Mprime := M+(k+1)^2 - (2*k*RL+3*RL+2*RL^2);
kprime := 1+k+2*RL;
[twol, RL, Mprime, kprime];
end;
guessb:=[0,5]; b:=5; guessc:=[0,5]; c:=5;
for i from 1 to 100 do
t1:=f(b,c);
b:=t1[4]; c:=t1[3]; guessb:=[op(guessb),b]; guessc:=[op(guessc),c];
od:
guessb; guessc;

a=b=c=d=n=0; L={0}; While[Length[L] < 22, n++; a=b; b=c; c=d; d=c + If[c < n^2, n^2, -n^2]; If[a > b < c < d, AppendTo[L, b]]]; L (* Giovanni Resta, Oct 01 2019 *)

\\ See Tomas Rokicki's PARI program in A076042.

More terms from Giovanni Resta, Oct 01 2019

cp's OEIS Frontend

A324792 First differences of A325056: distance in A076042 from n-th low point to the next.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Extensions

A076042 a(0) = 0; thereafter a(n) = a(n-1) + n^2 if a(n-1) < n^2, otherwise a(n) = a(n-1) - n^2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Extensions

A324791 Value of A076042 at its n-th low point.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Extensions