|
|
|
|
|
|
|
|
|
#15 by Susanna Cuyler at Sat Dec 15 08:34:08 EST 2018
|
|
|
|
|
|
|
|
#14 by Michel Marcus at Sat Dec 15 06:38:34 EST 2018
|
|
|
|
|
|
|
|
#13 by Michel Marcus at Sat Dec 15 05:49:17 EST 2018
|
|
| LINKS
|
V. Shevelev, <a href="httphttps://arXivarxiv.org/abs/0904.2101">Several results on sequences which are similar to the positive integers</a>, arXiv:0904.2101 [math.NT], 2009.
|
|
|
|
|
|
|
#12 by Michel Marcus at Sat Dec 15 05:48:16 EST 2018
|
|
| PROG
|
(PARI) is(n) = valuation(n, 2)%2==0; \\ A003159
nexta(a, n) = {my(k=a+1, isn = is(n)); while (is(k) != isn, k++); k; };
lista(nn) = {my(a = 3); print1(a, ", "); for (n=2, nn, a = nexta(a, n); print1(a, ", "); ); } \\ Michel Marcus, Dec 15 2018
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#11 by Susanna Cuyler at Sun Jul 29 08:10:04 EDT 2018
|
|
|
|
|
|
|
|
#10 by Michel Marcus at Sat Jul 28 16:37:29 EDT 2018
|
|
|
|
|
|
|
|
#9 by Michel Marcus at Sat Jul 28 16:37:25 EDT 2018
|
|
| FORMULA
|
For n>=1, A010060(a(n))= A010060(A004760(n+1)). See also A160230. [From _. [_Vladimir Shevelev_, May 05 2009]
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#8 by Jean-François Alcover at Sat Jul 28 16:28:54 EDT 2018
|
|
|
|
|
|
|
|
#7 by Jean-François Alcover at Sat Jul 28 16:28:50 EDT 2018
|
|
| MATHEMATICA
|
a35263[n_] := 1 - Mod[IntegerExponent[n, 2], 2];
a[1] = 3; a[n_] := a[n] = For[k = a[n - 1] + 1, True, k++, If[a35263[k] == a35263[n], Return[k]]];
Array[a, 66] (* Jean-François Alcover, Jul 28 2018 *)
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#6 by Bruno Berselli at Thu Nov 23 05:13:06 EST 2017
|
|
|
|
|
|
|
