Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)

Revision History for A120861

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A120861 Fixed-k dispersion for Q = 8: Square array D(g,h) (g, h >= 1), read by ascending antidiagonals.
(history; published version)
#33 by R. J. Mathar at Wed Jul 22 09:43:17 EDT 2020
STATUS

editing

approved

#32 by R. J. Mathar at Wed Jul 22 09:06:30 EDT 2020
CROSSREFS

Cf. A087056, A087059, A120858, A120859, A120860, A120862, A120863, A336109 (first column), A002315 (first row), A001542 (2nd row), A253811 (3rd row).

STATUS

approved

editing

#31 by Peter Luschny at Sat Jul 11 03:07:20 EDT 2020
STATUS

reviewed

approved

#30 by Michel Marcus at Sat Jul 11 02:46:06 EDT 2020
STATUS

proposed

reviewed

#29 by Michel Marcus at Thu Jul 09 03:20:50 EDT 2020
STATUS

editing

proposed

#28 by Michel Marcus at Thu Jul 09 03:20:33 EDT 2020
PROG

(PARI) f(n) = 3*n + 2*floorsqrtint(n2*sqrt(n^2)) + ) + 2;

STATUS

proposed

editing

#27 by Petros Hadjicostas at Wed Jul 08 20:05:16 EDT 2020
STATUS

editing

proposed

#26 by Petros Hadjicostas at Wed Jul 08 20:02:42 EDT 2020
CROSSREFS

Cf. A087056, A087059, A120858, A120859, A120860, A120862, A120863., A336109 (first column).

STATUS

proposed

editing

Discussion
Wed Jul 08 20:04
Petros Hadjicostas: Michel, I created A336109 as the first column of array D since the first column is extremely important here. I used your program and cited you properly.
#25 by Michel Marcus at Wed Jul 08 15:13:31 EDT 2020
STATUS

editing

proposed

#24 by Michel Marcus at Wed Jul 08 15:13:03 EDT 2020
PROG

(PARI) f(n) = 3*n + 2*floor(n*sqrt(2)) + 2

unused(listus) = {my(v=vecsort(Vec(listus))); for (i=1, vecmax(v), if (!vecsearch(v, i), return (i)); ); };

D(nb) = {my(m = matrix(nb, nb), t); my(listus = List); for (g=1, nb, if (g==1, t = 1, t = unused(listus)); m[g, 1]=t; listput(listus, t); t = f(t); m[g, 2]=t; listput(listus, t); for (h=3, nb, t = 6*m[g, h-1] - m[g, h-2]; m[g, h] = t; listput(listus, t); ); ); m; }; \\ Michel Marcus, Jul 08 2020

STATUS

proposed

editing

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 11 21:59 EDT 2024. Contains 375839 sequences. (Running on oeis4.)