C :

#include<stdio.h>
int getn(int n){
	if(n==1){
		return 1;
	}else{
		return getn(n-1)+n;
	}
}
int main(){
	int i,n,s=0;
	scanf("%d",&n);
	for(i=1;i<=n;i++){
		s=s+getn(i);
	} 
	printf("%d",s);
	return 0;
}

C++ :

#include<iostream>
using namespace std;

int digui(int n);

int main(){
	int n=0,s=0;
	cin>>n;
	
	for(int i=1;i<=n;i++){
		
		s=s+digui(i);
	}
	cout<<s<<endl;
}

int digui(int n){
	
	if(n==1)
		return 1;
	else
		return n+digui(n-1);
}

Pascal :

var a,i,s:longint;
    b:array[0..100000] of longint;
begin
read(a);
for i:=1 to a do
b[i]:=b[i-1]+i;
for i:=1 to a do
s:=s+b[i];
write(s);
end.

Java :

import java.util.Scanner;
public class Main{
	public static void main(String[] args) {
		Scanner scanner=new Scanner(System.in);
		int n=scanner.nextInt();
		int sum=0;
		int a=0;
		for(int i=1;i<=n;i++){
			a=a+i;
			sum=sum+a;
		}
		System.out.println(sum);
	}
}

Python :

def jiMu(n):
        #1,3,6,10,15
        s = 0
        if n == 1:
                s = 1
        else:
               s = jiMu(n-1) + n 
        return s
n = int(input())
s = 0
for i in range (1,n +1):
        s += jiMu(i)
print(s)