Sezai ATA - cp's OEIS frontend

User: Sezai ATA

Sezai ATA has authored 2 sequences.

A305100 Least nonnegative integer which requires n letters to spell in Turkish excluding spaces and hyphens.

3, 1, 4, 0, 14, 18, 21, 24, 28, 68, 124, 128, 168, 224, 228, 268, 468, 868, 1268, 1468, 1868, 2268, 2468, 2868, 4868, 8868, 14868, 18868, 21868, 24868, 28868, 68868, 124868, 128868, 168868, 224868, 228868, 268868, 468868, 868868, 1068868, 1124868, 1128868, 1168868

Offset: 2

Sezai Ata, May 25 2018

			a(2) = 3: "üç", a(3) = 1: "bir", a(5) = 0: "sıfır"

Sezai Ata, MATLAB program, 2018.
Wikibooks, Turkish numbers
Index entries for sequences related to number of letters in n

Turkish version of A134629.

Cf. A057435.

from num2words import num2words
from itertools import count, islice
def f(n): return sum(1 for c in num2words(n, lang='tr') if c.isalpha())
def agen(): # generator of terms
    n, adict = 2, dict()
    for k in count(0):
        v = f(k)
        if v not in adict:
            adict[v] = k
            while n in adict:
                yield adict[n]
                n += 1
print(list(islice(agen(), 44))) # Michael S. Branicky, Sep 01 2025

a(16)-a(41) from Daniel Suteu, May 26 2018

a(42)-a(45) from Michael S. Branicky, Sep 01 2025

A259013 a(n) is the smallest number of grains of sand placed at the center square of a (2n-1) X (2n-1) table so that some grains drop off the table by the end of the diffusion process.

Original entry on oeis.org

4, 16, 44, 88, 144, 208, 320, 408, 512, 672, 788, 948, 1096, 1288, 1552, 1768, 1960, 2208, 2456, 2708, 3028, 3384, 3648, 3964, 4348, 4728, 5076, 5448, 5884, 6308, 6708, 7176, 7644, 8240, 8664, 9132, 9764, 10276, 10816, 11404, 11992, 12516, 13264, 13816, 14388

Offset: 1

Sezai ATA, Jun 16 2015

nonn

The diffusion rule is that if a square has more than 3 grains of sand then it loses 4 grains and each neighbor's number of grains increases by one. Initially the center square has a(n) sand grains and all other squares are empty. The final distribution of sand grains and the number a(n) do not depend on the order of the diffusion process. For this reason, it is called an "abelian sandpile model".

Scott R. Shannon, Table of n, a(n) for n = 1..1000
Wikipedia. Abelian Sandpile Model

% S(k) gives the minimum number of grains of sand needed at the center
% of a (2n-1) X (2n-1) square table for some grains to drop off
% the table in an "abelian sandpile model".
firstsand=zeros(1,49);
S=zeros(1,49);
n=50;
lim=2*n-1;
A=zeros(lim,lim);
for j=1:17128;
    A(n,n)= A(n,n)+1;
    while max(max(A))>=4
        for xi=1:lim
            for yi=1:lim
                if A(xi,yi) >= 4
                    A(xi,yi)= A(xi,yi) - 4;
                    A(xi+1,yi)=A(xi+1,yi) + 1;
                    A(xi,yi+1)=A(xi,yi+1) + 1;
                    A(xi-1,yi)=A(xi-1,yi) + 1;
                    A(xi,yi-1)=A(xi,yi-1) + 1;
                end
            end
        end
    end
    for k=1:n-1
        if A(n,n+k)==1 && firstsand(k)==0
        firstsand(k)=1;
        S(k)=j;
        end
    end
end

a(21)-a(45) from Giovanni Resta, Jun 17 2015

cp's OEIS Frontend

User: Sezai ATA

A305100 Least nonnegative integer which requires n letters to spell in Turkish excluding spaces and hyphens.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

Extensions