The sequence having the greatest known growth rate while remaining fully decomposable under the #decompwlj criterion is A003312
a(1) = 3; for n>0, a(n+1) = a(n) + floor((a(n)-1)/2): https://oeis.org/A003312
Table of n, a(n) for n = 1..1000: https://oeis.org/A003312/b003312.txt

#math #numbers #sequence #OEIS #sieve

We see the fundamental theorem of arithmetic and the sieve of Eratosthenes in the decomposition into weight × level + jump of natural numbers. Applied to prime numbers this decomposition leads to a new classification of primes.

#decompwlj #math #mathematics #maths #sequence #OEIS #graph #natural #numbers #primes #PrimeNumbers #FundamentalTheoremOfArithmetic #sequences #NumberTheory #classification #integer #decomposition #number #theory #equation #graphs #sieveOfEratosthenes #Eratosthenes #sieve #fundamental #theorem #arithmetic #research

It’s hard coming up with new number sequence puzzles because the #OEIS already has most of them years before I thought of them 

My first, favorite and most important sequence, the weights of prime numbers: A117078
We see prime numbers classified by level and by weight on the graph.

A117078: a(n) is the smallest k such that prime(n+1) = prime(n) + (prime(n) mod k), or 0 if no such k exists ➡️ https://oeis.org/A117078

#decompwlj #math #mathematics #maths #sequence #OEIS #graph #numbers #primes #PrimeNumbers #FundamentalTheoremOfArithmetic #sequences #NumberTheory #classification #integer #decomposition #number #theory #equation #graphs #sieve #fundamental #theorem #arithmetic #research

Here's a sequence that I can sort of believe isn't in the #OEIS, but really should be for completeness:

1,1,3,3,3,6,7,7,9, ...

a(n) is the smallest integer k such that all numbers up to n are in the Collatz trajectory of some number less than or equal to k.

It's an upper bound for a sequence that is in, A372810: the smallest number whose Collatz trajectory contains n.

Can I be bothered to submit it? probs not!