cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A265903 Square array read by descending antidiagonals: A(1,k) = A188163(k), and for n > 1, A(n,k) = A087686(1+A(n-1,k)).

Original entry on oeis.org

1, 3, 2, 5, 7, 4, 6, 12, 15, 8, 9, 14, 27, 31, 16, 10, 21, 30, 58, 63, 32, 11, 24, 48, 62, 121, 127, 64, 13, 26, 54, 106, 126, 248, 255, 128, 17, 29, 57, 116, 227, 254, 503, 511, 256, 18, 38, 61, 120, 242, 475, 510, 1014, 1023, 512, 19, 42, 86, 125, 247, 496, 978, 1022, 2037, 2047, 1024, 20, 45, 96, 192, 253, 502, 1006, 1992, 2046, 4084, 4095, 2048
Offset: 1

Views

Author

Antti Karttunen, Dec 18 2015

Keywords

Comments

Square array A(n,k) [where n is row and k is column] is read by descending antidiagonals: A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), etc.
For n >= 3, each row n lists the numbers that appear n times in A004001. See also A051135.

Examples

			The top left corner of the array:
     1,    3,    5,    6,     9,    10,    11,    13,    17,    18,    19
     2,    7,   12,   14,    21,    24,    26,    29,    38,    42,    45
     4,   15,   27,   30,    48,    54,    57,    61,    86,    96,   102
     8,   31,   58,   62,   106,   116,   120,   125,   192,   212,   222
    16,   63,  121,  126,   227,   242,   247,   253,   419,   454,   469
    32,  127,  248,  254,   475,   496,   502,   509,   894,   950,   971
    64,  255,  503,  510,   978,  1006,  1013,  1021,  1872,  1956,  1984
   128,  511, 1014, 1022,  1992,  2028,  2036,  2045,  3864,  3984,  4020
   256, 1023, 2037, 2046,  4029,  4074,  4083,  4093,  7893,  8058,  8103
   512, 2047, 4084, 4094,  8113,  8168,  8178,  8189, 16006, 16226, 16281
  1024, 4095, 8179, 8190, 16292, 16358, 16369, 16381, 32298, 32584, 32650
  ...

Links

Crossrefs

Inverse permutation: A267104.
Transpose: A265901.
Row 1: A188163.
Row 2: A266109.
Row 3: A267103.
For the known and suspected columns, see the rows listed for transposed array A265901.
Cf. A004001, A051135, A087686.
Cf. A265900 (main diagonal), A265909 (submain diagonal).
Cf. A162598 (column index of n in array), A265332 (row index of n in array).
Cf. also permutations A267111, A267112.

Programs

Formula

For the first row n=1, A(1,k) = A188163(k), for rows n > 1, A(n,k) = A087686(1+A(n-1,k)).

A051135 a(n) = number of times n appears in the Hofstadter-Conway $10000 sequence A004001.

Original entry on oeis.org

2, 2, 1, 3, 1, 1, 2, 4, 1, 1, 1, 2, 1, 2, 3, 5, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 3, 1, 2, 3, 4, 6, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 2, 3, 1, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, 7, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 2, 3, 1, 1, 1, 2, 1, 1, 2, 1, 2, 3, 1, 1, 2, 1, 2, 3, 1, 2, 3
Offset: 1

Views

Author

Robert Lozyniak (11(AT)onna.com)

Keywords

Comments

If the initial 2 is changed to a 1, the resulting sequence (A265332) has the property that if all 1's are deleted, the remaining terms are the sequence incremented. - Franklin T. Adams-Watters, Oct 05 2006
a(A088359(n)) = 1 and a(A087686(n)) > 1; first differences of A188163. - Reinhard Zumkeller, Jun 03 2011
From Robert G. Wilson v, Jun 07 2011: (Start)
a(k)=1 for k = 3, 5, 6, 9, 10, 11, 13, 17, 18, 19, 20, 22, 23, 25, 28, ..., ; (A088359)
a(k)=2 for k = 1, 2, 7, 12, 14, 21, 24, 26, 29, 38, 42, 45, 47, 51, 53, ..., ; (1 followed by A266109)
a(k)=3 for k = 4, 15, 27, 30, 48, 54, 57, 61, 86, 96, 102, 105, 112, ..., ; (A267103)
a(k)=4 for k = 8, 31, 58, 62, 106, 116, 120, 125, 192, 212, 222, 226, ..., ;
a(k)=5 for k = 16, 63, 121, 126, 227, 242, 247, 253, 419, 454, 469, ..., ;
a(k)=6 for k = 32, 127, 248, 254, 475, 496, 502, 509, 894, 950, 971, ..., ;
a(k)=7 for k = 64, 255, 503, 510, 978, 1006, 1013, 1021, 1872, 1956, ..., ;
a(k)=8 for k = 128, 511, 1014, 1022, 1992, 2028, 2036, 2045, 3864, ..., ;
a(k)=9 for k = 256, 1023, 2037, 2046, 4029, 4074, 4083, 4093, 7893, ..., ;
a(k)=10 for k = 512, 2047, 4084, 4094, 8113, 8168, 8178, 8189, ..., . (End)
Compare above to array A265903. - Antti Karttunen, Jan 18 2016

Links

Crossrefs

Cf. A004001, A087686, A093879, A188163, A266109, A267103 and array A265903.
Cf. A088359 (positions of ones).
Cf. A265332 (essentially the same sequence, but with a(1) = 1 instead of 2).

Programs

  • Haskell
    import Data.List (group)
a051135 n = a051135_list !! (n-1)
a051135_list = map length $ group a004001_list
-- Reinhard Zumkeller, Jun 03 2011
  • Magma
    nmax:=200;
h:=[n le 2 select 1 else Self(Self(n-1)) + Self(n - Self(n-1)): n in [1..5*nmax]]; // h = A004001
A188163:= function(n)
   for j in [1..3*nmax+1] do
       if h[j] eq n then return j; end if;
   end for;
end function;
A051135:= func< n | A188163(n+1) - A188163(n) >;
[A051135(n): n in [1..nmax]]; // G. C. Greubel, May 20 2024
  • Maple
    a[1]:=1: a[2]:=1: for n from 3 to 300 do a[n]:=a[a[n-1]]+a[n-a[n-1]] od: A:=[seq(a[n],n=1..300)]:for j from 1 to A[nops(A)-1] do c[j]:=0: for n from 1 to 300 do if A[n]=j then c[j]:=c[j]+1 else fi od: od: seq(c[j],j=1..A[nops(A)-1]); # Emeric Deutsch, Jun 06 2006
  • Mathematica
    a[1] = 1; a[2] = 1; a[n_] := a[n] = a[a[n - 1]] + a[n - a[n - 1]]; t = Array[a, 250]; Take[ Transpose[ Tally[t]][[2]], 105] (* Robert G. Wilson v, Jun 07 2011 *)
  • SageMath
    @CachedFunction
def h(n): return 1 if (n<3) else h(h(n-1)) + h(n - h(n-1)) # h=A004001
def A188163(n):
    for j in range(1,2*n+1):
        if h(j)==n: return j
def A051135(n): return A188163(n+1) - A188163(n)
[A051135(n) for n in range(1,201)] # G. C. Greubel, May 20 2024
  • Scheme
    (define (A051135 n) (- (A188163 (+ 1 n)) (A188163 n))) ;; Antti Karttunen, Jan 18 2016

Formula

From Antti Karttunen, Jan 18 2016: (Start)
a(n) = A188163(n+1) - A188163(n). [after Reinhard Zumkeller's Jun 03 2011 comment above]
Other identities:
a(n) = 1 if and only if A093879(n-1) = 1. [See A188163 for a reason.]
(End)

Extensions

More terms from Jud McCranie
Added links (in parentheses) to recently submitted related sequences - Antti Karttunen, Jan 18 2016
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.