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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A191669 Dispersion of A004767 (4k+3, k>=0), by antidiagonals. 8
1, 3, 2, 11, 7, 4, 43, 27, 15, 5, 171, 107, 59, 19, 6, 683, 427, 235, 75, 23, 8, 2731, 1707, 939, 299, 91, 31, 9, 10923, 6827, 3755, 1195, 363, 123, 35, 10, 43691, 27307, 15019, 4779, 1451, 491, 139, 39, 12, 174763, 109227, 60075, 19115, 5803, 1963, 555, 155 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

For a background discussion of dispersions, see A191426.

...

Each of the sequences (4n, n>2), (4n+1, n>0), (3n+2, n>=0), generates a dispersion. Each complement (beginning with its first term >1) also generates a dispersion. The six sequences and dispersions are listed here:

...

A191452=dispersion of A008586 (4k, k>=1)

A191667=dispersion of A016813 (4k+1, k>=1)

A191668=dispersion of A016825 (4k+2, k>=0)

A191669=dispersion of A004767 (4k+3, k>=0)

A191670=dispersion of A042968 (1 or 2 or 3 mod 4 and >=2)

A191671=dispersion of A004772 (0 or 1 or 3 mod 4 and >=2)

A191672=dispersion of A004773 (0 or 1 or 2 mod 4 and >=2)

A191673=dispersion of A004773 (0 or 2 or 3 mod 4 and >=2)

...

EXCEPT for at most 2 initial terms (so that column 1 always starts with 1):

A191452 has 1st col A042968, all else A008486

A191667 has 1st col A004772, all else A016813

A191668 has 1st col A042965, all else A016825

A191669 has 1st col A004773, all else A004767

A191670 has 1st col A008486, all else A042968

A191671 has 1st col A016813, all else A004772

A191672 has 1st col A016825, all else A042965

A191673 has 1st col A004767, all else A004773

...

Regarding the dispersions A191670-A191673, there is a formula for sequences of the type "(a or b or c mod m)", (as in the Mathematica program below):

   If f(n)=(n mod 3), then (a,b,c,a,b,c,a,b,c,...) is given by

   a*f(n+2)+b*f(n+1)+c*f(n), so that "(a or b or c mod m)" is given by

   a*f(n+2)+b*f(n+1)+c*f(n)+m*floor((n-1)/3)), for n>=1.

LINKS

Ivan Neretin, Table of n, a(n) for n = 1..5050 (first 100 antidiagonals, flattened)

EXAMPLE

Northwest corner:

1...3....11....43....171

2...7....27....107...427

4...15...59....235...939

5...19...75....299...1195

6...23...91....363...1451

MATHEMATICA

(* Program generates the dispersion array T of the increasing sequence f[n] *)

r = 40; r1 = 12; c = 40; c1 = 12;

f[n_] := 4*n-1

Table[f[n], {n, 1, 30}] (* A004767 *)

mex[list_] := NestWhile[#1 + 1 &, 1, Union[list][[#1]] <= #1 &, 1, Length[Union[list]]]

rows = {NestList[f, 1, c]};

Do[rows = Append[rows, NestList[f, mex[Flatten[rows]], r]], {r}];

t[i_, j_] := rows[[i, j]];

TableForm[Table[t[i, j], {i, 1, 10}, {j, 1, 10}]] (* A191669 *)

Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191669 *)

CROSSREFS

Row 1: A007583, Row 2: A136412.

Cf. A004773, A004767, A191673, A191426.

Sequence in context: A013945 A072656 A330313 * A163841 A276589 A275950

Adjacent sequences:  A191666 A191667 A191668 * A191670 A191671 A191672

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling, Jun 11 2011

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 06:37 EST 2020. Contains 331033 sequences. (Running on oeis4.)