neoneye

from tqdm import tqdm
import whois
import csv

# Base parts of the names to combine
base_parts = [
    'paper', 'rock', 'scissors',
]

# Suffixes to append

neoneye

bfile(name, v, offset=1, limit=1000)={
  my(cur=offset-1,F);
  for(i=1,#v,
    if (#Str(v[i]) > limit,
      print("Next term has "#Str(v[i])" digits; exiting.");
      break
    );
    my(s=Str(cur++, " ", v[i]));
    print(s);
  );

neoneye

items = []
values = Array.new(1000) do |i|
    n = i + 2
    x = (n ** 2) / 2
    y = Integer.sqrt(x)
    value = x % y
    items << [n, x, y, value]
    value
end
IO.write('a338277_values.csv', values.join("\n"))

neoneye

def plot_modulus(values, count)
    puts
    s = values.map {|v| v.to_s(count) }.join('')
    count.times do |i|
        value = i.to_s(count)
        re = Regexp.new("[^" + value + "]")
        puts '# ' + s.gsub(re, ' ')
    end
end

neoneye

require 'prime'

def plot(values, modvalue)
    puts
    puts "plot(values, #{modvalue})"
    s = values.map {|v| (v % modvalue).to_s(modvalue) }.join('')
    modvalue.times do |i|
        value = i.to_s(modvalue)
        re = Regexp.new("[^" + value + "]")
        puts '# ' + s.gsub(re, ' ')

neoneye

# 2.920050977316 - A Prime-Representing Constant
# by Dylan Fridman, Juli Garbulsky, Bruno Glecer, James Grime, Massi Tron Florentin
#
# Numberphile
# https://www.youtube.com/watch?v=_gCKX6VMvmU
#
# Article
# https://arxiv.org/abs/2010.15882
#
# OEIS sequence

neoneye

use std::io::Write;


std::env::set_var("RUST_LOG", "debug");

env_logger::builder()
    .format(|buf, record| {
        writeln!(buf, "{} - {}:{} - {}", record.level(), record.file().unwrap_or("N/A"), record.line().unwrap_or(0), record.args())
    })
    .init();

neoneye

# Regarding
# https://oeis.org/draft/A338530
# https://oeis.org/A136437
#
# Hugo Pfoertner: Can you please check the relation to A136437? It seems that (a(n)+2)/2 = (A136437-1)/2 for the even terms after a(31).
# Hugo Pfoertner: I checked against A136437 and found a(n)=A136437(n)-3 for 31<=n<=128.
#
# Here is output of the two sequences A136437 and A338530. They are indeed the same for this range.
#
require 'prime'

neoneye

require 'prime'
PRIMES = Prime.first(1000)

# Kevin Ryde pointed out that A337724 corresponds to this formula, with crazy rounding
# prime(n) - prime(n-2)/2 + prime(n-4)/2^2 - prime(n-6)/2^3 + ...
# What about A337723, does it have a similar formula, with crazy rounding?
# Yes, I think I have found a formula that can do it.

accumulator_a = 0.5
accumulator_b = 1

neoneye

require 'prime'
PRIMES = Prime.first(1000)

# Kevin Ryde pointed out that A337724 corresponds to this formula, with crazy rounding
# prime(n) - prime(n-2)/2 + prime(n-4)/2^2 - prime(n-6)/2^3 + ...
values = [0, 1]
30.times do |i|
    sum = 0
    power = 0
    sign = 1