I made 290 has slower and less flashing lights so people with epilepsy possibly aren't triggered (having seizures), also this is possibly not the final version, i might change it again later Changed things: Flash speed: Originally the light flashes are every 0.1 sec/10 flashes per second, now it's 0.3 sec/3.333... flashes per second (previously 0.2 sec/5 flashes per second) Light intensity: Originally the light intensity is 100%, now changed to 40% IMPORTANT NOTE: don't really know if this version already not making people with epilepsy triggered, so if you have epilepsy and is triggered with the band, feel free to tell me
I realized that seizures can be triggering when the flashing is 5-30 flashes per second/0.0333...-0.2 sec per flash (source: https://www.epilepsy.com/what-is-epilepsy/seizure-triggers/photosensitivity), so i decided to change the flashing to 0.3 sec per flash I'm going to make Tau/τ (NBB Retro Pi's, 8.625 (NBB Sixteenths), 29, 197, and 291 with less flashing lights, though i won't make it immediately after this IMPORTANT (i think): I want to ask anyone who do mathematical sequence or base bands, how did you found the numbers for the sequence or base? with some "advanced" AIs (AIs that can do much human things like ChatGPT or Gemini) or with some "not really advanced" calculation programs (programs that can't do much other than calculations), like web programs or your phone calculator? Well, i think you better use calculation programs that is enough to give accurate amounts if you find one (like Super Exponent and Factorial Calculator though it takes several time to calculate), especially if the sequence just involves integers or finite-digit decimals or rationals that it can be calculated exactly by your phone's calculator, rather than "advanced" AIs, though i think it's better to use AI for the calculations rather than for the art (drawing, music, etc.) because i think AI is pretty easy to deal with calculations, not art, or if you can't find a program that gives you the exact value of a number (like if the number is 1 quadrillion or above), maybe try to calculate it yourself with some help from the programs you found, also calculation of 10^any integer is easy to write their exact values (calculator not needed) if you can not lose count on how many zeros there are, and for the bases, it's better to calculate the numbers by a "not really advanced" calculation programs or by yourself with an accurate base converting method with some help from a calculator especially when converting to base 100 or any other bases that (the radix) is a power (like 1000, 10000, and other 10^x where x is an integer, for example 113 in base 100 is 1D (alphanumeric notation), as every two digits from the ones place to the left is wrapped into one (1|13, 1 becomes 1, while 13 becomes D), because you just need to wrap several digits into one, or integer root (square root, cube root, 4th root, or any base of 10^(1/x) where x is an integer), as you just need to add several zeroes between the digits, you don't need to make the number have infinite digits, and also, in standard base xth root of y (digits are integers from 0 to y) (x and y are integers, and y≠1), ALL numbers are representable, especially rationals that they DON'T need infinite not-looping digits to represent (for example 280 in base √10 is 20800 because each two place value to the left is 10× bigger) nth triangular number=n(n+1)/2 2^127-1=170 141 183 460 469 231 731 687 303 715 884 105 727≈1.70141183×10^38=about 170 undecillion (integer limit (128-bit) and mersenne prime) (calculated using Super Exponent and Factorial Calculator with simple subtraction) To calculate if the starting digit of a number is a "ones" (in the place value of 10^(3n)), "tens" (in the place value of 10^(3n+1)), or "hundreds" (in the place value 10^(3n+2)) (n is an integer), you need to check the scientific notation of the number (something×10^j) (something is a number more or equal than 1 but less than 10n and j is an integer which 10^j is the biggest power of 10 smaller than something×10^j) and see the exponent, then find the exponent (j) mod 3, you can divide the number by 3 to find it, that if the number ends with ".3333...", j mod 3 is 1, if the number ends with ".6666...", j mod 3 is 2, and if the number doesn't end in a decimal point (divisible by 3), j mod 3 is 0 (or 3?) or divisible by 3), or calculating the digit sum, find the digit sum, and calculate the digit sum mod 3, or calculate the digit sum of the digit sum again until it reaches a single digit, if the single digit is 1, 4, or 7, j mod 3 is 1, if the single digit is 2, 5, or 8, j mod 3 is 2, and if the single digit is 3, 6, or 9, j mod 3 is 0 (or 3?) The 53rd perfect number is EXACTLY UNKNOWN, as the 53rd mersenne prime MUST be found for it and it will take years, as the 52nd mersenne prime is found years after the 51st, having an estimated value will lead to inaccuracy more than the inaccuracy of 1000000000! in my Basic Factorial Calculator
