#!/usr/bin/perl -w # Copyright 2010, 2011, 2012, 2013, 2020 Kevin Ryde # This file is part of Math-PlanePath. # # Math-PlanePath is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the Free # Software Foundation; either version 3, or (at your option) any later # version. # # Math-PlanePath is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY # or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License # for more details. # # You should have received a copy of the GNU General Public License along # with Math-PlanePath. If not, see . # A182619 Number of vertices that are connected to two edges in a spiral without holes constructed with n hexagons. # A182617 Number of toothpicks in a toothpick spiral around n cells on hexagonal net. # A182618 Number of new grid points that are covered by the toothpicks added at n-th-stage to the toothpick spiral of A182617. # A063178 Hexagonal spiral sequence: sequence is written as a hexagonal spiral around a `dummy' center, each entry is the sum of the row in the previous direction containing the previous entry. # A063253 Values of A063178 on folding point positions of the spiral. # A063254 Values of A062410 on folding point positions of the spiral. # A063255 Values of A063177 on folding point positions of the spiral. # A113519 Semiprimes in first spoke of a hexagonal spiral (A056105). # A113524 Semiprimes in second spoke of a hexagonal spiral (A056106). # A113525 Semiprimes in third spoke of a hexagonal spiral (A056107). # A113527 Semiprimes in fourth spoke of a hexagonal spiral (A056108). # A113528 Semiprimes in fifth spoke of a hexagonal spiral (A056109). # A113530 Semiprimes in sixth spoke of a hexagonal spiral (A003215). Semiprime hex (or centered hexagonal) numbers. # A113653 Isolated semiprimes in the hexagonal spiral. use 5.004; use strict; use Test; plan tests => 18; use lib 't','xt'; use MyTestHelpers; BEGIN { MyTestHelpers::nowarnings(); } use MyOEIS; use List::Util 'min', 'max'; use Math::PlanePath::HexSpiral; use Math::NumSeq::PlanePathTurn; # uncomment this to run the ### lines # use Smart::Comments '###'; my @dir6_to_dx = (2, 1,-1,-2, -1, 1); my @dir6_to_dy = (0, 1, 1, 0, -1,-1); #------------------------------------------------------------------------------ # sloped lines foreach my $elem (['A062783', 3, 1, n_start => 0], ['A063436', -3, -1, n_start => 0], # ['A063436', -3, 1, n_start => 0], # not in OEIS: 0,13,50,111,196,305,438 # ['A063436', 3, -1, n_start => 0], # not in OEIS: 0,7,38,93,172,275 # not A270704 is double # ['A000001', 0, 2, n_start => 0], # not in OEIS: 0,11,46,105,188,295 ['A000002', 0, -2, n_start => 0], # not in OEIS: 0,17,58,123,212,325,462 # names of these are angles starting vertical Y axis and # measuring clockwise ['A244802', 3, 1], # 30 deg 1, 10, 43, 100 ['A244803', 0, 2], # 90 deg 1, 12, 47, 106 ['A244804', -3, 1], # 150 deg ['A244805', -3, -1], # -150 deg ['A244806', 0, -2], # -90 deg ) { my ($anum,$dx,$dy, %options) = @$elem; MyOEIS::compare_values (anum => $anum, name => "line slope $dx,$dy", func => sub { my ($count) = @_; my @got; my $path = Math::PlanePath::HexSpiral->new (%options); my $x = 0; my $y = 0; while (@got < $count) { push @got, $path->xy_to_n ($x,$y); $x += $dx; $y += $dy; } return \@got; }); } #------------------------------------------------------------------------------ # A001399 -- N where turn left MyOEIS::compare_values (anum => 'A001399', max_value => 100_000, func => sub { my ($count) = @_; my @got = (1); # extra initial 1 in A001399 my $seq = Math::NumSeq::PlanePathTurn->new (planepath => 'HexSpiral,n_start=0', turn_type => 'Left'); while (@got < $count) { my ($i,$value) = $seq->next; if ($value) { push @got, $i; } } return \@got; }); #------------------------------------------------------------------------------ # A328818 -- X coordinate # A307012 -- Y coordinate MyOEIS::compare_values (anum => 'A328818', func => sub { my ($count) = @_; my $path = Math::PlanePath::HexSpiral->new (n_start => 0); my @got; for (my $n = 0; @got < $count; $n++) { my ($x,$y) = $path->n_to_xy($n); push @got, $x; } return \@got; }); MyOEIS::compare_values (anum => 'A307012', func => sub { my ($count) = @_; my $path = Math::PlanePath::HexSpiral->new (n_start => 0); my @got; for (my $n = 0; @got < $count; $n++) { my ($x,$y) = $path->n_to_xy($n); push @got, $y; } return \@got; }); # A307011 horiz # A307012 60 deg # A307013 120 deg # (X-Y)/2 MyOEIS::compare_values (anum => 'A307011', func => sub { my ($count) = @_; my $path = Math::PlanePath::HexSpiral->new (n_start => 0); my @got; for (my $n = 0; @got < $count; $n++) { my ($x,$y) = $path->n_to_xy($n); push @got, ($x-$y)/2; } return \@got; }); # (X+Y)/2 MyOEIS::compare_values (anum => 'A307013', func => sub { my ($count) = @_; my $path = Math::PlanePath::HexSpiral->new (n_start => 0); my @got; for (my $n = 0; @got < $count; $n++) { my ($x,$y) = $path->n_to_xy($n); push @got, ($x+$y)/2; } return \@got; }); #------------------------------------------------------------------------------ # A274920 -- smallest of 0,1,2 not an existing neighbour MyOEIS::compare_values (anum => q{A274920}, # not shown in POD func => sub { my ($count) = @_; my $path = Math::PlanePath::HexSpiral->new (n_start => 0); my @got; for (my $n = $path->n_start; @got < $count; $n++) { my ($x,$y) = $path->n_to_xy($n); my @seen; foreach my $dir6 (0 .. 5) { my $n2 = $path->xy_to_n($x + $dir6_to_dx[$dir6], $y + $dir6_to_dy[$dir6]); defined $n2 or die; if ($n2 < $n) { $seen[$got[$n2]] = 1; } } for (my $i = 0; ; $i++) { if (!$seen[$i]) { push @got, $i; last; } } } return \@got; }); #------------------------------------------------------------------------------ # A135708 -- grid sticks of N hexagons # /\ /\ # | | | # \/ \/ MyOEIS::compare_values (anum => 'A135708', func => sub { my ($count) = @_; my $path = Math::PlanePath::HexSpiral->new; my @got; my $boundary = 0; for (my $n = $path->n_start; @got < $count; $n++) { $boundary += 6 - triangular_num_preceding_neighbours($path,$n); push @got, $boundary; } return \@got; }); #------------------------------------------------------------------------------ # A135711 -- boundary length of N hexagons # /\ /\ # | | | # \/ \/ MyOEIS::compare_values (anum => 'A135711', func => sub { my ($count) = @_; my $path = Math::PlanePath::HexSpiral->new; my @got; my $boundary = 0; for (my $n = $path->n_start; @got < $count; $n++) { $boundary += 6 - 2*triangular_num_preceding_neighbours($path,$n); push @got, $boundary; } return \@got; }); BEGIN { my @surround6_dx = (2, 1,-1, -2, -1, 1); my @surround6_dy = (0, 1, 1, 0, -1, -1); sub triangular_num_preceding_neighbours { my ($path, $n) = @_; my ($x,$y) = $path->n_to_xy ($n); my $count = 0; foreach my $i (0 .. $#surround6_dx) { my $n2 = $path->xy_to_n($x + $surround6_dx[$i], $y + $surround6_dy[$i]); $count += (defined $n2 && $n2 < $n); } return $count; } } #------------------------------------------------------------------------------ # A063436 -- N on slope=3 WSW MyOEIS::compare_values (anum => 'A063436', func => sub { my ($count) = @_; my @got; my $path = Math::PlanePath::HexSpiral->new (n_start => 0); my $x = 0; my $y = 0; while (@got < $count) { push @got, $path->xy_to_n ($x,$y); $x -= 3; $y -= 1; } return \@got; }); #------------------------------------------------------------------------------ # A063178 -- a(n) is sum of existing numbers in row of a(n-1) # 42 # \ # 2-----1 33 # / \ \ # 3 0-----1 23 # \ / # 5-----8----10 # # ^ ^ ^ ^ ^ ^ ^ MyOEIS::compare_values (anum => 'A063178', func => sub { my ($count) = @_; my $path = Math::PlanePath::HexSpiral->new; my @got; require Math::BigInt; my %plotted; $plotted{2,0} = Math::BigInt->new(1); my $xmin = 0; my $ymin = 0; my $xmax = 2; my $ymax = 0; push @got, 1; for (my $n = $path->n_start + 2; @got < $count; $n++) { my ($prev_x, $prev_y) = $path->n_to_xy ($n-1); my ($x, $y) = $path->n_to_xy ($n); ### at: "$x,$y prev $prev_x,$prev_y" my $total = 0; if (($y > $prev_y && $x < $prev_x) || ($y < $prev_y && $x > $prev_x)) { ### forward diagonal ... foreach my $y ($ymin .. $ymax) { my $delta = $y - $prev_y; my $x = $prev_x + $delta; $total += $plotted{$x,$y} || 0; } } elsif (($y == $prev_y && $x < $prev_x) || ($y == $prev_y && $x > $prev_x)) { ### opp diagonal ... foreach my $y ($ymin .. $ymax) { my $delta = $y - $prev_y; my $x = $prev_x - $delta; $total += $plotted{$x,$y} || 0; } } else { ### row: "$xmin .. $xmax at y=$prev_y" foreach my $x ($xmin .. $xmax) { $total += $plotted{$x,$prev_y} || 0; } } ### total: "$total" $plotted{$x,$y} = $total; $xmin = min($xmin,$x); $xmax = max($xmax,$x); $ymin = min($ymin,$y); $ymax = max($ymax,$y); push @got, $total; } return \@got; }); #------------------------------------------------------------------------------ exit 0;